import math

def solve(A: int, B: int):
    L = A * A + B * B

    retA: list[tuple[int, int]] = []
    retB: list[tuple[int, int]] = []

    for idx in range(L):
        if A > B:
            retA.append((B * idx % L, A * idx % L))
            retB.append((B * idx % L, A * (idx + 1) % L))
        else:
            retA.append((B * idx % L, A * (idx + 1) % L))
            retB.append((B * idx % L, A * idx % L))
    
    return retA, retB

A, B = map(int, input().split())

G = math.gcd(A, B)
# print(A, B, G)

tmpA, tmpB = solve(A // G, B // G)

retA: list[tuple[int, int]] = []
retB: list[tuple[int, int]] = []

for x in range(G):
    for y in range(G):
        for a, b in tmpA:
            retA.append((a * G + x * A // G, b * G + y * B // G))
        for a, b in tmpB:
            retB.append((a * G + x * A // G, b * G + y * B // G))

for a, b in sorted(retA):
    print(a, b)
for a, b in sorted(retB):
    print(a, b)