#include <iostream>
#include <queue>
using namespace std;

struct cor{
	int x;
	int y;
};
queue <cor> coada;
cor aux,z;
int viz[205][205];
int main()
{
	int a,b,i;
	int n=200;
	aux.x=0;
	aux.y=0;
	coada.push(aux);
	viz[z.x][z.y]=1;
	while(coada.size()!=0)
	{	
		z=coada.front();
		
		cout<<z.x<<" "<<z.y<<"\n";
		cout.flush();
		cin>>i;
		coada.pop();
		if (i==0)
			break;
		else 
			if (i<0)
			{
				if (z.x+1<n && z.y+1<n && viz[z.x+1][z.y+1]!=1)
				{
					aux.x=z.x+1;
					aux.y=z.y+1;
					coada.push(aux);
					viz[z.x+1][z.y+1]=1;
				}
				if (z.x+1<n && viz[z.x+1][z.y]!=1)
				{
					aux.x=z.x+1;
					aux.y=z.y;
					coada.push(aux);
					viz[z.x+1][z.y]=1;
				}
				if (z.y+1<n && viz[z.x][z.y+1]!=1)
				{
					aux.x=z.x;
					aux.y=z.y+1;
					coada.push(aux);
					viz[z.x][z.y+1]=1;
				}
			}
	}
}