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.
a, b = map(int, input().split())
for ax in range(1, a):
    ay = (a ** 2 - ax ** 2) ** 0.5
    if int(ay) == ay:
        ay = int(ay)
        by = ((b ** 2) / (1 + (ay ** 2) / (ax ** 2))) ** 0.5
        bx = (-ay / ax) * by
        if int(bx) == bx and int(by) == by:
            bx = int(bx)
            by = int(by)
            O = 0, 0
            A = ax, ay
            B = bx, by
            break
else:
    print('NO')
    exit()
print('YES')
print(*O)
print(*A)
print(*B)
