#include<bits/stdc++.h>
#define int long long
#define double long double
#define lowbit(x) x&(-x)
#define fastios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define endl '\n'
#define el puts("")
#define udm unordered_map<int,int>
#define set_0(a) memset(&a,0,sizeof(a))
#define set_unint(a) memset(&a,-1,sizeof(a))
using namespace std;
//define_var
const int M=2e5+9,inf=1e18;
bool isok[M];
int n,k;
int pro;
//define_var
//function_begin
//int read()
//{
//	int x=0,f=1;
//	char c=getchar();
//	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
//	while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
//	return x*f;
//}
//void write(int x)
//{
//	if(x<0) putchar('-'),x=-x;
//	if(x>9) write(x/10);
//	putchar(x%10+'0');
//}
int read(int i,int j)
{
	cout<<i<<" "<<j<<endl;
	int x;
	cin>>x;
	return x;
}
bool check(int x)
{
	for(int i=0;i<(1<<(n-x));i++)
		isok[i]=0;
	int now=0;
	pro=read(x,x);
	if(k!=pro)
	{
		if(pro==k-1)
			k=read(x,x);
		else
			k=pro;
		if(pro==n)
			return true;
		else
			return false;
	}
	isok[now]=1;
	k=pro;
	while(true)
	{
		bool flag=1;
		for(int i=0;i<(1<<(n-x));i++)
			flag&=isok[i];
		if(flag)
			return false;
		for(int i=0;i<(1<<(n-x));i++)
		{
			if(isok[i]) continue;
			int ps=-1,cnt=0;
			int c1=now,c2=i;
			for(int j=0;j<(n-x);j++)
			{
				if(c1%2==c2%2)
				{
					c1/=2,c2/=2;
					continue;
				}
				cnt++;
				ps=j;
				c1/=2,c2/=2;
			}
			if(cnt==1)
			{
				pro=read(x,n-ps);
				k=pro;
				pro=read(x,x);
				now=i;
				if(k!=pro)
				{
					if(pro==k-1)
						k=read(x,x);
					else
						k=pro;
					if(pro==n)
						return true;
					else
						return false;
				}
				isok[now]=1;
				k=pro;
				break;
			}
		}
	}
	return false;
}
//function_end
//solve_begin
void solve()
{
	cin>>n>>k;
	if(k==n)
		return;
	for(int i=1;i<=n;i++)
	{
		if(check(i))
			return;
	}
}
//solve_end
//main_begin
signed main()
{
//	fastios
	int T=1;
//	cin>>T;
	while(T--)
		solve();
}
//main_end