#include <bits/stdc++.h>

#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 rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;

inline void ask(ll x, ll y)
{
    cout << x << " " << y << endl;
}

inline void hear(ll& d)
{
    cin >> d;
}

int main()
{
    ll d1, d2, d3;
    ll x, y;

    ask(0, 0);
    hear(d1);

    x = d1;
    y = d1;
    ask(x, 0);
    hear(d2);

    ask(0, y);
    hear(d3);

    if (d2 < 2 * d1) {
        if (d3 == 2 * d1) {
            ask(d1 - d2 / 2, -d2 / 2);
        } else {
            ask(d1 - d2 / 2, d2 / 2);
        }
    } else {
        if (d3 < 2 * d1) {
            ask(d3 / 2, d1 - d3 / 2);
        } else {
            ask(0, -d1);
            ll d4;
            hear(d4);
            ask(-d4 / 2, -d1 + d4 / 2);
        }
    }

    return 0;
}