#include"bits/stdc++.h"

//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout<<x<<endl;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a) for(int i=0;i<a;i++)
typedef long long ll;
const ll mod = 10000000000;

int main() {
	int max = 1000000000;
	int nowx, nowy;
	int dx[4] = { 1, 1, -1, -1 };
	int dy[4] = { 1, -1, 1, -1 };
	int now_dist;
	print(max / 2 << " " << max / 2);
	int n,m = mod;
	cin >> n;
	REP(i, 4) {
		print(max / 2 + dx[i] * n / 2 << " " << max / 2 + dy[i] * n / 2);
		cin >> now_dist;
		if (m > now_dist) {
			m = now_dist; nowx = max / 2 + dx[i] * n / 2; nowy = max / 2 + dy[i] * n / 2;
		}
	}
	REP(i, 4) {
		print(nowx + dx[i] * m / 2 << " " << nowy + dy[i] * m / 2);
		int d = 0;
		cin >> d;
		if (d == 0)return 0;
	}

	print(max / 2+1 << " " << max / 2);
	m = mod;
	cin >> n;
	REP(i, 4) {
		print(max / 2 + dx[i] * n / 2 << " " << max / 2 + dy[i] * n / 2);
		cin >> now_dist;
		if (m > now_dist) {
			m = now_dist; nowx = max / 2 + dx[i] * n / 2; nowy = max / 2 + dy[i] * n / 2;
		}
	}
	REP(i, 4) {
		print(nowx + dx[i] * m / 2 << " " << nowy + dy[i] * m / 2);
		int d = 0;
		cin >> d;
		if (d == 0)return 0;
	}
	return 0;
}