#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    ll lx = 0, hx = 1e+9;
    ll ly = 0, hy = 1e+9;
    for(int i = 0; i < 10; ++i){
        ll px = (lx * 2 + hx) / 3, qx = (lx + hx * 2) / 3;
        ll py = (ly * 2 + hy) / 3, qy = (ly + hy * 2) / 3;
        ll d1, d2;
        cout << px << ' ' << py << endl;
        cin >> d1;
        if(d1 == 0) return 0;
        cout << qx << ' ' << qy << endl;
        cin >> d2;
        if(d2 == 0) return 0;
        if(d1 < d2){
            hx = qx; hy = qy;
        }
        else{
            lx = px; ly = py;
        }
    }

    return 0;
}