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.
def dist(a, b):
    return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2

a, b = map(int, input().split())
pnt_a, pnt_b = [], []
for i in range(1, 1000):
    j = 1
    while j*j + i*i <= 1000000:
        if i*i + j*j == a*a: pnt_a.append((i, j))
        if i*i + j*j == b*b: pnt_b.append((-i, j))
        j += 1
for i in pnt_a:
    for j in pnt_b:
        if i[1] != j[1] and dist(i, j) == a*a + b*b:
            print("YES")
            print("0 0")
            print(i[0], i[1])
            print(j[0], j[1])
            exit()
print("NO")
