#include<bits/stdc++.h>

using namespace std;

const int B = 32; 
const int MAXN = 1e5 + 5;

int a[MAXN];
int p, n, subsum[MAXN], dep[MAXN];
int sum, bel[MAXN], idx[MAXN], b[MAXN];

bool mark[MAXN];

pair<int,int> c[MAXN]; 

mt19937 rnd(time(0));

inline void build(int p, int l, int r){
	subsum[p]=r-l+1;
	if(l==r) return dep[p]=1, void();
	int mid=(l+r)>>1;
	build(p<<1,l,mid), build(p<<1|1,mid+1,r); dep[p]=dep[p<<1]+1;
	return ;
}

inline int add(int p, int l, int r, int pos){
	subsum[p]--; int res=0;
	if(subsum[p]==0) res=dep[p];
	if(l==r) return res;
	int mid=(l+r)>>1;
	if(pos<=mid) res=max(add(p<<1,l,mid,pos),res);
	else res=max(add(p<<1|1,mid+1,r,pos),res);
	return res;
}

inline void solve1(){
	cout << 7 << endl; int sum=0;
	for(int i=0;i<B;++i) bel[i]=i/2; 
	for(int i=1;i<=n-B;++i){
		int x;
		cin >> x; sum+=x, sum%=65536;
		cout << 7 << endl; mark[x]=1, a[x]=7; 
	}
	int tot=0;
	for(int i=0;i<n;++i){
		if(mark[i]) continue;
		idx[i]=tot; b[tot]=i; ++tot;
	}
	build(1,0,B-1);
//	cerr << "sum=" << sum << endl;
	for(int i=1;i<B;++i){
		int x; 
		cin >> x;
		int t=add(1,0,B-1,idx[x]);
//		cerr << "t=" << t << endl;
		if(t>1) cout << t+1 << endl, a[x]=t+1;
		else{
			if((sum>>bel[idx[x]])&1) t=2;
			cout << t << endl, a[x]=t; 
		}
	}
	return ;
}

inline void solve2(){
	for(int i=0;i<n;++i) cin >> a[i];
	int tot7=0;
	for(int i=0;i<n;++i) tot7+=a[i]==7;
	if(n-tot7==B){
		int tot=0;
		for(int i=0;i<n;++i)
			if(a[i]==7) continue;
			else c[++tot]=make_pair(max(a[i],2),i);
		int l=1, r=B, now=6;
		while(l<=r){
			int mid=(l+r)>>1, L=-1, R=-1;
			for(int i=l;i<=mid;++i) L=(c[i].first==now?c[i].second:L);
			for(int i=mid+1;i<=r;++i) R=(c[i].first==now?c[i].second:R);
//			if(L==-1 && R==-1) exit(1);
			if(L!=-1 && R!=-1){
				cout << L << ' ' << R << endl;
				return ; 
			}
			if(L==-1) r=mid-1;
			else l=mid+1; --now;
		}
	}
	else{
		int s=0, tot=0, ss=0;
		for(int i=0;i<n;++i) s+=i, s%=65536;
		for(int i=0;i<n;++i){
			if(a[i]==7) continue;
			(s+=65536-i%65536)%=65536;
			if(a[i]==1) ++tot;
			if(a[i]==2) ss|=1<<tot, ++tot;
		}
		ss%=65536;
//		cerr << "sum=" << ss << endl;
		(s+=65536-ss)%=65536;
//		cerr << "lol" << endl;
		cout << s << ' ' << min(n-1,s+65536) << endl; 
	}
	return ;
}

int main(){
//	freopen("guess.in","r",stdin);
//	freopen("guess.out","w",stdout);
	cin >> p >> n;	
	if(p==1) solve1();
	else solve2();	
}