#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

int rx=30,ry=40;
int q(int x,int y){
	int a;
	cout<<x<<" "<<y<<endl;
	cin>>a;
	// a=abs(rx-x)+abs(ry-y);
	// cout<<a<<endl;
	if(a==0)exit(0);
	return a;
}
int main(void){
	int a=100000,b=0;
	int x=100000;
	int p,r,s;
	while(a>b){
		int m=(a+b)/2;
		int A=q(x,m);
		int B=q(x,m+1);
		int C=q(x,m-1);
		if(B==C)a=b=m;
		else if(B>C)a=m-1;
		else if(B<C)b=m+1;
	}
	p=q(0,(a+b)/2);
	q(p,(a+b)/2);
	return 0;
}