#include <atcoder/modint>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using mint = atcoder::modint;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll a, b;
  cin >> a >> b;
  ll L = a * a + b * b;
  mint::set_mod(L);
  bool swapped = false;
  if (a > b) {
    swap(a, b);
    swapped = true;
  }
  vector<vector<pair<ll, ll>>> ans(2);
  bool first = true;
  ll g = __gcd(a, b);
  for (mint i = 0, j = 0; first || !(i == 0 && j == 0); i += a, j += b) {
    vector offset(2, vector<mint>(2, 0));
    offset[1][0] = a;
    rep(gi, g) {
      ll i0 = (i + offset[0][0]).val();
      ll j0 = (j + offset[0][1]).val();
      ll i1 = (i + offset[1][0]).val();
      ll j1 = (j + offset[1][1]).val();
      ans[0].emplace_back(i0, j0);
      ans[1].emplace_back(i1, j1);
      if (gi % 2 == 0) {
        offset[0][0] += a + b + b;
        offset[0][1] += b - a;
        offset[1][0] += b;
      } else {
        offset[0][1] -= a;
        offset[1][0] += b + a;
        offset[1][1] += b - a - a;
      }
    }
    first = false;
  }
  if (swapped)
    swap(ans[0], ans[1]);
  rep(i, 2) rep(j, ans[i].size()) {
    cout << ans[i][j].first << ' ' << ans[i][j].second << '\n';
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}