#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool solve(int a, int b) {
	bool rev = false;
	if (a < b) {
		rev = true;
		swap(a, b);
	}
	int g = gcd(a, b);
	a /= g;
	b /= g;
	vector<P>pa, pb;
	int  x = 0, y = 0;
	int size = a * a + b * b;
	rep(i, size) {
		pa.emplace_back(x, y);
		pb.emplace_back((x + a) % size, y);
		x = (x + a) % size;
		y = (y + b) % size;
	}
	vector<P>spa, spb;
	rep(_, 2) {
		rep(i, g)rep(j, g) {
			rep(k, size) {
				spa.emplace_back((pa[k].first + i * size) * g, (pa[k].second + j * size) * g);
			}
		}
		swap(pa, pb);
		swap(spa, spb);
	}
	swap(pa, spa);
	swap(pb, spb);
	if (rev)swap(pa, pb);
	rep(i, pa.size())cout << pa[i].first << " " << pa[i].second << endl;
	rep(i, pb.size())cout << pb[i].first << " " << pb[i].second << endl;
	return true;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int a, b; cin >> a >> b;
	solve(a, b);
	return 0;
}