#include <bits/stdc++.h>
using namespace std;
using LL = long long;

const int mxn = 105 * 105 * 2;

int a, b, L;
vector<pair<int, int>> pa, pb;
vector<int> dax, day, dbx, dby;
map<int, int> vis[mxn];

bool ok (int x, int y) {
	return x >= 0 && y >= 0 && x < L && y < L && !vis[x][y];
}

void bfsa(int x, int y);
void bfsb(int x, int y);

void bfsa(int x, int y) {
	// printf("a: (%d, %d)\n", x, y);
	vis[x][y] = 1;
	pa.emplace_back(x, y);
	for (int d = 0; d < 4; ++d) {
		int nx = x + dax[d], ny = y + day[d];
		if (ok(nx, ny)) bfsb(nx, ny);
	}
}
void bfsb(int x, int y) {
	// printf("b: (%d, %d)\n", x, y);
	vis[x][y] = 2;
	pb.emplace_back(x, y);
	for (int d = 0; d < 4; ++d) {
		int nx = x + dbx[d], ny = y + dby[d];
		if (ok(nx, ny)) bfsa(nx, ny);
	}
}

int main() {
	cin >> a >> b;
	L = a * a + b * b;
	bool flag = false;
	if (a < b) swap(a, b), flag = true;
	dax = { a - b, a, 0, -b};
	day = { a, 0, -b, a - b};
	dbx = { 0, b, b - a, -a};
	dby = { b, b - a, -a, 0};
	bfsa(0, 0);
	if (flag) swap(pa, pb);
	for (auto [x, y] : pa) printf("%d %d\n", x, y);
	for (auto [x, y] : pb) printf("%d %d\n", x, y);
	return 0;
}