#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
//#if DEBUG
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());
//#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;

int check(int x, int y) {
    cout << x << " " << y << endl;
    int d;
    cin>>d;
    return d;
}

void solve() {
    int t1 = check(0,0);
    if (t1==0) return;
    int t2 = check(1e9,0);
    if (t2==0) return;
    /*
     x + y = t1
     1e9 - x + y = t2
     
     1e9 + 2y = t1 + t2
     y = (t1 + t2 - 1e9) / 2
     
     2x - 1e9 = t1 - t2
     x = (t1 - t2 + 1e9) / 2
     */
    int x = (t1 - t2 + 1e9)/2;
    int y = (t1 + t2 - 1e9)/2;
    check(x,y);
}