//you cannot mark for urself
//everyone marks for some other guy:
//ambiguity: if everyone marks for one other guy, there needs to be 999998 markers
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define lsb(x) (x&(-x))
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting " << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
#define vi vector<int>
#define vpii vector<pii>
#define fr(i,x,y) for(int i=x;i<=y;i++)
int p,n;
//if info is repeated twice it is reliable
int ip(){int x;cin>>x;return x;}
void op(int x){cout<<x<<endl;cout.flush();}
void op2(int x, int y){cout<<x<<" "<<y<<endl;cout.flush();}
const int segno=317,segsz=316;
const int lastsz=144;
void Alice()
{
//segment numbers 0 indexed, segment counts themselves are 1-indexed
vector<int>cnt(segno,0),ursz(segno,316);
ursz[segno-1]=lastsz;
int k=segsz+segno-2;
int secdeg=0;
op(k);
int t1,t2;
for(int i=0;i<n;i++)
{
cin>>t1;
int grp=t1/segsz;
if(cnt[grp]==ursz[grp]-1){t2=k-secdeg;secdeg++;}
else {t2=++cnt[grp];}
op(t2);
}
}
void Bob()
{
int k=segsz+segno-2;
vector<vi>cnt(segno,vi(segsz,-1));
vector<int>ursz(segno,segsz);
ursz[segno-1]=lastsz;
vi lastcnt(segno-1,-1);
vi ans;
for(int i=0;i<n;i++)
{
int t1;cin>>t1;
int grp=t1/segsz;
if(t1>=ursz[grp]&&t1<segsz){ans.pb(i);}
else if(t1<ursz[grp])
{
if(cnt[grp][t1]!=-1){ans.pb(i);ans.pb(cnt[grp][t1]);}
cnt[grp][t1]=i;
}
else
{
if(lastcnt[k-t1]!=-1){ans.pb(lastcnt[k-t1]);ans.pb(i);}
lastcnt[k-t1]=i;
}
}
if(ans[0]==0){ans.pb(1);}
else{ans.pb(0);}
op2(ans[0],ans[1]);
}
signed main()
{
int t1,t2,t3,t4;
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>p>>n;
if(p==1)
{
Alice();
}
else
{
Bob();
}
return 0;
}
