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 py(n):
    nsq = n**2
    ans = []
    for i in range(3, n):
        for j in range(3, n):
            if i**2 + j**2 == nsq:
                return i, j
    return None

a, b = map(int, input().split())
mini = min(a, b)
maxi = max(a, b)
div = maxi / mini
pya = py(a)
if pya: x, y = pya
if div != int(div) or not pya:
    print("NO")
else:
    print("YES")
    x, y = pya
    print(0, 0)
    print(x, y)
    print(-int(y * div), int(x * div))