There is a right triangle with legs of length *a* and *b*. Your task is to determine whether it is possible to locate the triangle on the plane in such a way that none of its sides is parallel to the coordinate axes. All the vertices must have integer coordinates. If there exists such a location, you have to output the appropriate coordinates of vertices.
The first line contains two integers *a*, *b* (1 ≤ *a*, *b* ≤ 1000), separated by a single space.
inn = input().split()
a = int(inn[0])
b = int(inn[1])
A = []
B = []
ok = False
for i in range(1, a + 1):
    for j in range(1, a + 1):
        if i * i + j * j == a * a:
            A.append((i, j))
for i in range(1, b + 1):
    for j in range(1, b + 1):
        if i * i + j * j == b * b:
            B.append((i, j))
for i in A:
    for j in B:
        if i[1] != j[1] and (-i[0] - j[0]) ** 2 + (i[1] - j[1]) ** 2 == a * a + b * b:
            print(-i[0], i[1])
            print(j[0], j[1])
            print(0, 0)
            ok = True
            break
    if ok:
        break
if not ok:
    print("NO")
