#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define mt make_tuple
#define zero(a, b) setw(a)<<setfill('0')<<b
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum accumulate
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << endl;}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
map<pii, double> m;
double ans = 1e9;
double f(int x, int y) {
	if (m.find(pii(x, y)) == m.end()) {
		print(x, y);
		cin >> ans;
		m[pii(x, y)] = ans;
	}
	if (ans == 0)
		exit(0);
	return m[pii(x, y)];
}
int main() {
	for(int a: {0, 100000}) {
		for(int b: {0, 100000}) {
			if (f(a, b) == 0)
				return 0;
		}
	}
	int x = 0, y = 0;
	int l = 0, r = 1e5, mid_l, mid_r;
	while ((r - l) > 2) {
		mid_l = (l * 2 + r) / 3;
		mid_r = (l + r * 2) / 3;
		if (f(mid_l, y) > f(mid_r, y)) {
			l = mid_l;
		} else {
			r = mid_r;
		}
	}
	x = min({mp(f(l, y), l), mp(f(l + 1, y), l + 1), mp(f(l + 2, y), l + 2)}).se;
	l = 0, r = 1e5;
	while ((r - l) > 2) {
		mid_l = (l * 2 + r) / 3;
		mid_r = (l + r * 2) / 3;
		if (f(x, mid_l) > f(x, mid_r)) {
			l = mid_l;
		} else {
			r = mid_r;
		}
	}
	y = min({mp(f(x, l), l), mp(f(x, l + 1), l + 1), mp(f(x, l + 2), l + 2)}).se;
	return 0;
}