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.
x, y = map(int, input().split(' '))
one = False
two = False
fir = []
sec = []
for i in range(1, 32):
    for j in range(i+1, 32):
        if i**2+j**2 == x and not one:
            one = True
            fir = [i, j]
        if i**2+j**2 == y and not two:
            two = True
            sec = [i, j]

if fir == [] or sec == []:
    print("NO")
    quit()
print("YES")
print(1000, 1000)
print(1000-fir[0], 1000-fir[1])
print(1000+sec[0], 1000+sec[1])