#include using namespace std; /*/ #include using namespace atcoder; #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #pragma GCC target("avx,avx2,fma") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma") //*/ #define rep(i,n) for(int i=0;i; using ll = long long; using ull = unsigned long long; //*/ template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } typedef pair pii; typedef pair pll; typedef vector vll; typedef vector vint; random_device rnd; mt19937 rng(rnd()); void solve(){ int a,b; cin >> a >> b; int g = gcd(a,b); a /= g,b /= g; vector>> ps(2); int mod = a*a + b*b; int mx = max(a,b),mn = a+b-mx; int x = 0,y = 0; rep(i,mod){ ps[0].push_back(make_pair(x,y)); x += mn; y += mx; x %= mod; y %= mod; } x = 0,y = mx; rep(i,mod){ ps[1].push_back(make_pair(x,y)); x += mn; y += mx; x %= mod; y %= mod; } if(a == b){ rep(gx,g)rep(gy,g)rep(i,2){ for(auto [v,u] : ps[i]){ cout << u+gy*b << " " << v+gx*a << "\n"; } } }else{ if(a < b) swap(ps[0],ps[1]); rep(gx,g)rep(gy,g)rep(i,2){ for(auto [v,u] : ps[i]){ cout << u+gy*b << " " << v+gx*a << "\n"; } } } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; //cin >> t; rep(testcase,t) solve(); }