#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int query(int x, int y) {
	printf("%d %d\n", x, y);
	fflush(stdout);
	int d;
	scanf("%d", &d);
	return d;
}

int main() {
	const int W = 1000000000;
	int a = query(0, 0);
	int b = query(0, W);
	int x = (int)((ll)a + b - W) / 2;
	int y = a - x;
	query(x, y);
	return 0;
}