#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


map<pair<int,int>, int> memo;

int query(int x, int y){
  if(memo.find({x,y})!=memo.end()){
    return memo[make_pair(x,y)];
  }
  
  cout << x << " " << y << endl;
  int res;
  
  cin >> res;
  
  return memo[make_pair(x,y)] = res;
}

int main(){
  int x,y;
  int q1,q2;
  int res1, res2;
  int t1,t2;
  
  res1 = query(0,0);
  res2 = query(0,1000000000);

  t1 = abs(res1-res2);
  t2 = 1000000000;
  
  q1 = (t1 + t2)/2;
  q2 = abs(t1 - t2)/2;

  if(res1 < res2){
    y = min(q1,q2);
  }else{
    y = max(q1,q2);
  }

  x = query(0,y);
  
  query(x,y);
  
  return 0;
}