#include<bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

void vprint(vector<ll> A){
    ll L = A.size();
    FOR(i, 0, L){
        if(i) cout << ' ';
        cout << A[i];
    }
    cout << endl;
}

ll query(ll x, ll y){
    p2(x, y);
    ll d;
    cin >> d;
    if(d==0) exit(0);
    return d;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll left = -1;
    ll left_d = query(left, 0);
    ll right = 100000+1;
    ll right_d = query(right, 0);

    while(left+1!=right){
        ll center = (left+right)/2;
        ll d = query(center, 0);
        
        ll assumed_center_d = left_d - (center-left);
        if(assumed_center_d==d){
            left = center;
            left_d = d;
        }else{
            right = center;
            right_d = d;
        }
    }
    ll center_x = left;

    // Y
    left = -1;
    left_d = query(center_x, left);
    right = 100000+1;
    right_d = query(center_x, right);

    while(left+1!=right){
        ll center = (left+right)/2;
        ll d = query(center_x, center);
        
        ll assumed_center_d = left_d - (center-left);
        if(assumed_center_d==d){
            left = center;
            left_d = d;
        }else{
            right = center;
            right_d = d;
        }
    }
    
    return 0;
}