#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <functional>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <vector>
#include <array>
#include <tuple>
#include <utility>
#include <numeric>
#include <iomanip>
#include <cctype>
#include <cmath>
#include <assert.h>
#include <cstdlib>
#include <list>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;

template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {
    return s << "(" << p.first << ", " << p.second << ")";
}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
    s << "[";
    for (int i = 0; i < v.size(); i++) s << (i == 0 ? "" : ", ") << v[i];
    s << "]";
    return s;
}

#define ALL(a) (a).begin(), (a).end()

const ll NUM = 1000000000;
// const ll NUM = 10;


/*
ll calc(ll x, ll y) {
    return abs(x - t_x) + abs(y - t_y);
}
*/

int main() {
    ll a, b;
    /*
    cout << "宝 => ";
    cin >> t_x >> t_y;
    */

    cout << 0 << " " << 0 << endl;
    cin >> a;
    // a = calc(0, 0);

    cout << NUM << " " << 0 << endl;
    cin >> b;
    // b = calc(NUM, 0);

    ll y = (a + b - NUM) / 2,
       x = -y + a;
    cout << x << " " << y << endl;
    /*
    if (!(x == t_x && y == t_y)) {
        cout << "???????" << endl;
        cout << "[a] " << a << " [b] " << b << endl;
        cout << "[x] " << x << " [y] " << y << endl;
        cout << "[t_x] " << t_x << " " << "[t_y] " << t_y << endl;
    }
    */

    return 0;
}