#include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; vector> solve(const int a, const int b) { const int l = a * a + b * b; if (a < b) { auto tmp = solve(b, a); rotate(tmp.begin(), next(tmp.begin(), l), tmp.end()); return tmp; } vector> ans(l * 2); // vector sq(l, vector(l, 0)); for (int x = 0, y = 0, i = 0; i < l; x = (x + a) % l, y = (y + b) % l, ++i) { ans[i] = {x, y}; // REP(s, a) REP(t, a) ++sq[(x + s) % l][(y + t) % l]; ans[i + l] = {(x + a) % l, y}; // REP(s, b) REP(t, b) ++sq[(x + a + s) % l][(y + t) % l]; } // for (const vector& row : sq) { // assert(ranges::all_of(row, [](const int x) -> bool { return x == 1; })); // } return ans; } int main() { int a, b; cin >> a >> b; const int g = gcd(a, b); auto small = solve(a / g, b / g); for (auto& [x, y] : small) x *= g, y *= g; const int l = a * a + b * b; vector> side_a, side_b; side_a.reserve(l); side_b.reserve(l); REP(s, g) REP(t, g) { REP(i, l / g / g) { const auto [x, y] = small[i]; side_a.emplace_back(l / g * s + x, l / g * t + y); } REP(i, l / g / g) { const auto [x, y] = small[i + l / g / g]; side_b.emplace_back(l / g * s + x, l / g * t + y); } } for (const auto& [x, y] : side_a) cout << x << ' ' << y << '\n'; for (const auto& [x, y] : side_b) cout << x << ' ' << y << '\n'; return 0; }