import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



/*
  lattice by (A, B), (-B, A)
  one per each square of area (A^2 + B^2)
  
  (x, y) in the lattice
  A: [x, x+A] * [y, y+B]
  B: enclosed by [(x+As-Bt), (x+As-Bt)+A] * [(y+Bs+At), (y+Bs+At)+B]  (0 <= s,t <= 1)
    [x+A-B, x+A] * [y+A, y+A+B]
*/

void main() {
  try {
    for (; ; ) {
      const A = readInt;
      const B = readInt;
      
      const M = A^^2 + B^^2;
      int mod(int r) {
        return ((r %= M) < 0) ? (r + M) : r;
      }
      
      alias Pt = Tuple!(int, "x", int, "y");
      auto used = new RedBlackTree!Pt;
      Pt[] ps, qs;
      for (int i = 0; ; ++i) {
        const x0 = mod(A * i);
        const y0 = mod(B * i);
        if (!used.equalRange(Pt(x0, y0)).empty) break;
        for (int j = 0; ; ++j) {
          const x = mod(x0 - B * j);
          const y = mod(y0 + A * j);
          if (!used.equalRange(Pt(x, y)).empty) break;
          used.insert(Pt(x, y));
          ps ~= Pt(x, y);
          qs ~= Pt(mod(x + A - B), mod(y + A));
        }
      }
      debug {
        writeln([A, B, M, ps.length]);
      }
      foreach (p; ps ~ qs) {
        writeln(p.x, " ", p.y);
      }
    }
  } catch (EOFException e) {
  }
}