#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define mod 998244353
template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll ksm(ll a, ll b) {if (b == 0) return 1; ll ns = ksm(a, b >> 1); ns = ns * ns % mod; if (b & 1) ns = ns * a % mod; return ns;}
#define ar2 array<int, 2>
using namespace std;
const int maxn = 4005;
const int S = 40;
map<ar2, int> dis;
int caldis(ar2 x) {
    int ans = 1e9;
    if (dis.count(x)) return dis[x];
    for (int j = -S; j <= S; j++) 
        chkmin(ans, abs(j) + abs(x[0] + j) + abs(x[1] + j));
    return dis[x] = ans;
}
map<ar2, int> cov;
set<ar2> bd;
int base = 10;
ar2 x[6] = {{9, 0}, {9, 9}, {0, 9}, {-9, 0}, {-9, -9}, {0, -9}};
ar2 dir[6] = {{1, 0}, {1, 1}, {0, 1}, {-1, 0}, {-1, -1}, {0, -1}};
ar2 add(ar2 a, ar2 b) {
    return {a[0] + b[0], a[1] + b[1]};
}
int main() {
    for (int i = 0; i < 6; i++) {
        ar2 u = x[i], v = x[(i + 1) % 6];
        int h[2];
        for (int j = 0; j < 2; j++)
            h[j] = (u[j] - v[j]) / 9;
        for (int k = 0; k < 9; k++) {
            ar2 p = {u[0] - k * h[0], u[1] - k * h[1]};
            bd.insert(p);
        }
    }
    while (1) {
        ar2 u;
        cin >> u[0] >> u[1];
        int mstr = 1e9;
        ar2 ed = {-1, -1};
        for (auto v : bd) {
            if (cov[v]) continue;
            int adj = 0;
            int dis = caldis({v[0] - u[0], v[1] - u[1]});
           // cout << v[0] << " " << v[1] << " " << dis << endl;
            for (int j = 0; j < 6; j++) {
                ar2 res = add(v, dir[j]);
                if (!bd.count(res)) continue;
                if (cov[res]) adj += 1;
            }
            int str = 0;
            if (dis == 1) str = 1;
            else if (adj == 2 && dis >= 3) str = 100;
            else {
                if (dis == 2) str = dis;
                else str = adj * 2 + dis;
            }
            if (chkmin(mstr, str)) {
                ed = v;
               // cout << "!!! " << dis << ' ' << adj << endl;
                //cout << "!!!" << ' ' << ed[0] << ' ' << ed[1] << endl;
            }
        }
        if (mstr > 1e8) {
            for (int j = 0; j < 6; j++) {
                ar2 nx = add(u, dir[j]);
                if (cov[nx]) continue;
                mstr = 0;
                ed = nx;
                break;
            }
        }
        if (mstr > 1e7) break;
        cout << ed[0] << ' ' << ed[1] << endl;
        fflush(stdout);
        cov[ed] = 1;
        int end = 1;
        for (int j = 0; j < 6; j++) {
            ar2 nx = add(u, dir[j]);
            if (cov[nx])
                continue;
            end = 0;
        }
        if (end) break;
    }
    return 0;
}
/*
0 0
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
*/