#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 = 0, y = 0;
  
  int l=0, r = 100000;
  
  while(l<r){
    int mid = (r+l)/2;
    
    if(mid == 100000 || query(x,mid) < query(x,mid+1)){
      r = mid;
    }else{
      l = mid+1;
    }
  }

  y = l;

  l=0; r = 100000;

  while(l<r){
    int mid = (r+l)/2;
    
    if(mid == 100000 || query(mid,y) < query(mid+1,y)){
      r = mid;
    }else{
      l = mid+1;
    }
  }
  
  x = l;

  query(x,y);
  
  return 0;
}