#include <bits/stdc++.h>
#define AA 100
using namespace std;
mt19937 mt(20090908);
int vist[1005][1005], flag = 6 * 9;
int f[405][405], wz[1005][1005];
int gs = 0;

bool check(int x, int y) {
	if (max(abs(x), abs(y)) == 9)
		return 1;
	if (abs(x - y) == 9)
		return 1;
	return 0;
}
vector<pair<int, int>>v1, v2;

void del1(int x, int y) {
	for (auto cc = v1.begin(); cc != v1.end(); ++cc) {
		auto cu = *cc;
		if (cu.first == x && cu.second == y) {
			v1.erase(cc);
			break;
		}
	}
}

void del2(int x, int y) {
	for (auto cc = v2.begin(); cc != v2.end(); ++cc) {
		auto cu = *cc;
		if (cu.first == x && cu.second == y) {
			v2.erase(cc);
			break;
		}
	}
}

void opt(int x, int y) {
	if (!vist[x + AA][y + AA]) {
		vist[x + AA][y + AA] = 1;
		if (check(x, y))
			--flag;
	}
	del1(x, y), del2(x, y);
	cout << x << " " << y << endl;
}

void addedge(int x, int y, int xx, int yy) {
	int A = wz[x + AA][y + AA], B = wz[xx + AA][yy + AA];
	if (A && B)
		f[A][B] = f[B][A] = 1;
}

int dis(int x, int y, int xx, int yy) {
	int A = wz[x + AA][y + AA], B = wz[xx + AA][yy + AA];
	if (A && B)
		return f[A][B];
	return 1e9;
}

int main() {
	int tot = 0;
	for (int i = -9; i <= 9; ++i) {
		int L = -9, R = 9;
		if (i < 0)
			R = 9 + i;
		else
			L = -9 + i;
		for (int j = L; j <= R; ++j) {
			v1.emplace_back(make_pair(i, j));
			wz[i + AA][j + AA] = ++tot;
			if (check(i, j)) {
				v2.emplace_back(make_pair(i, j));
			}
		}
	}
	memset(f, 63, sizeof(f));
	for (int i = 1; i <= tot; ++i)
		f[i][i] = 0;
	for (auto vv : v1) {
		int X = vv.first, Y = vv.second;
		addedge(X, Y, X, Y + 1);
		addedge(X, Y, X + 1, Y);
		addedge(X, Y, X + 1, Y + 1);
	}
	for (int k = 1; k <= tot; ++k)
		for (int i = 1; i <= tot; ++i)
			for (int j = 1; j <= tot; ++j) {
				f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
			}
	int Cx, Cy;
	cin >> Cx >> Cy;
	srand(time(NULL));
	int xx = 7;
	opt(xx, xx);
	while (1) {
		if (scanf("%d%d", &Cx, &Cy) == EOF)
			return 0;
		if (Cx > Cy && !vist[xx + AA][0 + AA]) {
			opt(xx, 0);
			continue;
		}
		if (Cy < 0 && !vist[0 + AA][-xx + AA]) {
			opt(0, -xx);
			continue;
		}
		if (Cx < 0 && !vist[-xx + AA][-xx + AA]) {
			opt(-xx, -xx);
			continue;
		}
		if (Cx < Cy && !vist[-xx + AA][0 + AA]) {
			opt(-xx, 0);
			continue;
		}
		if (Cy > 0 && !vist[0 + AA][xx + AA]) {
			opt(0, xx);
			continue;
		}
		if (Cx > 0 && !vist[xx + AA][xx + AA]) {
			opt(xx, xx);
			continue;
		}
		if (!flag) {
			auto dy = v1[mt() % v1.size()];
			while (dy.first == Cx && dy.second == Cy)
				dy = v1[mt() % v1.size()];
			opt(dy.first, dy.second);
			continue;
		}
		int mx = 1e9;
		for (auto cu : v2) {
			int dd = dis(Cx, Cy, cu.first, cu.second);
			mx = min(mx, dd);
		}
		vector<pair<int, int>>g;
		for (auto cu : v2) {
			int dd = dis(Cx, Cy, cu.first, cu.second);
			if (dd == mx)
				g.emplace_back(cu);
		}
		vector<pair<int, int>>gg;
		mx = 1e9;
		for (auto cu : g) {
			int dd=0;
			for(auto uc:g)
				dd+=dis(cu.first,cu.second,uc.first,uc.second);
			if(mx>dd)mx=dd;
		}
		for (auto cu : g) {
			int dd=0;
			for(auto uc:g)
				dd+=dis(cu.first,cu.second,uc.first,uc.second);
			if (mx == dd)
				gg.emplace_back(cu);
		}
		auto dy = gg[mt() % gg.size()];
		opt(dy.first, dy.second);
	}
	return 0;
}