#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
	ll a, b;
	cin >> a >> b;
	ll n = a * a + b * b;
	ll area_left = n * n;

	ll a_left = n;
	ll b_left = n;
	ll x = 0;
	ll y = 0;
	vector<pair<ll,ll>> a_list;
	vector<pair<ll,ll>> b_list;

	ll g = __gcd(a * a, b * b);

	int mode = 0;
	for (int f=0; f<g; f++){
		for (int t=0; t<(a*a+b*b)/g*2; t++){
			if (mode == 0){
				a_list.push_back(pair(x, y));
				x += a;
				x %= n;
				a_left -= 1;
				area_left -= a * a;
			}else{
				b_list.push_back(pair(x, y));
				y += b;
				y %= n;
				b_left -= 1;
				area_left -= b * b;
			}
			mode ^= 1;
		}
		if (mode == 0){
			x += a;
			x %= n;
		}else{
			y += b;
			y %= n;
		}
	}

	assert(a_left == 0);
	assert(b_left == 0);
	assert(area_left == 0);

	for (auto [x, y]: a_list){
		cout << x << ' ' << y << '\n';
	}
	for (auto [x, y]: b_list){
		cout << x << ' ' << y << '\n';
	}
	
}