#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

int get(int a, int b) {
    cout << a << " " << b << endl;
    int inp; cin >> inp;
    return inp;
}

signed main() {
    int ubx = 100010, lbx = -1, uby = 100010, lby = -1;
    int ax, ay, mx = INF, my = INF;

    while(ubx - lbx > 1) {
        int m = (ubx + lbx) / 2;
        int s1 = get(m-1, 0);
        int s2 = get(m,   0);
        int s3 = get(m+1, 0);
        if(s1 < s2 && s2 < s3) ubx = m;
        if(s1 > s2 && s2 > s3) lbx = m;
        if(s1 > s2 && s2 < s3) {ax = m; break;}
    }

    while(uby - lby > 1) {
        int m = (uby + lby) / 2;
        int s1 = get(ax, m-1);
        int s2 = get(ax, m  );
        int s3 = get(ax, m+1);
        if(s1 < s2 && s2 < s3) uby = m;
        if(s1 > s2 && s2 > s3) lby = m;
        if(s1 > s2 && s2 < s3) {ay = m; break;}
    }

    int ans;
    cout << ax << " " << ay << endl;
    cin >> ans;
    return 0;
}