Vasya has got three integers n, m and k. He'd like to find three integer points (x_1, y_1), (x_2, y_2), (x_3, y_3), such that 0 ≤ x_1, x_2, x_3 ≤ n, 0 ≤ y_1, y_2, y_3 ≤ m and the area of the triangle formed by these points is equal to nm/k.

Help Vasya! Find such points (if it's possible). If there are multiple solutions, print any of them.

Input

The single line contains three integers n, m, k (1≤ n, m ≤ 10^9, 2 ≤ k ≤ 10^9).

Output

If there are no such points, print "NO".

Otherwise print "YES" in the first line. The next three lines should contain integers x_i, y_i — coordinates of the points, one point per line. If there are multiple solutions, print any of them.

You can print each letter in any case (upper or lower).

Examples

Input

4 3 3


Output

YES
1 0
2 3
4 1


Input

4 4 7


Output

NO

Note

In the first example area of the triangle should be equal to nm/k = 4. The triangle mentioned in the output is pictured below: 

<image>

In the second example there is no triangle with area nm/k = 16/7.
import sys
# sys.stdin = open('inp', 'r')


def area(p1, p2, p3):
    p = [p1, p2, p3]
    s = 0
    for i in range(3):
        s += p[i][1] * (p[(i + 1) % 3][0] - p[(i + 2) % 3][0])
    return abs(s) / 2.


n, m, k = map(int, input().split())
if (2 * n * m) % k != 0:
    print('NO')
    sys.exit()

X = (n * m) / k
if X == 0.5:
    print('YES')
    print(0, 0)
    print(0, 1)
    print(1, 0)
    sys.exit()

pts = [(0, 0)]
if 2 % k == 0:
    h, b = 2 // k, n * m
    if b <= n and h <= m:
        pts.append((0, h)), pts.append((b, 0))
    elif b <= m and h <= n:
        pts.append((h, 0)), pts.append((0, b))
if m % k == 0:
    h, b = 2 * n, m // k
    if b <= n and h <= m:
        pts.append((0, h)), pts.append((b, 0))
    elif b <= m and h <= n:
        pts.append((h, 0)), pts.append((0, b))
if n % k == 0:
    h, b = 2 * m, n // k
    if b <= n and h <= m:
        pts.append((0, h)), pts.append((b, 0))
    elif b <= m and h <= n:
        pts.append((h, 0)), pts.append((0, b))
if (2 * m) % k == 0:
    h, b = n, (2 * m) // k
    if b <= n and h <= m:
        pts.append((0, h)), pts.append((b, 0))
    elif b <= m and h <= n:
        pts.append((h, 0)), pts.append((0, b))
if (2 * n) % k == 0:
    h, b = m, (2 * n) // k
    if b <= n and h <= m:
        pts.append((0, h)), pts.append((b, 0))
    elif b <= m and h <= n:
        pts.append((h, 0)), pts.append((0, b))
if (n * m) % k == 0:
    h, b = 2, (n * m) // k
    if b <= n and h <= m:
        pts.append((0, h)), pts.append((b, 0))
    elif b <= m and h <= n:
        pts.append((h, 0)), pts.append((0, b))

if len(pts) == 1:
    Y = (2 * n * m) // k
    for i in range(1, int(Y**0.5) + 1):
        if Y % i == 0:
            h, b = i, Y // i
            if b <= n and h <= m:
                pts.append((0, h)), pts.append((b, 0))
            elif b <= m and h <= n:
                pts.append((h, 0)), pts.append((0, b))
            h, b = b, h
            if b <= n and h <= m:
                pts.append((0, h)), pts.append((b, 0))
            elif b <= m and h <= n:
                pts.append((h, 0)), pts.append((0, b))
    if len(pts) == 1:
        print('NO')
    else:
        print('YES')
        for p in pts[:3]:
            print(p[0], p[1])
else:
    for i in range(1, len(pts), 2):
        if area(pts[0], pts[i], pts[i + 1]) == X:
            print('YES')
            print(0, 0)
            print(pts[i][0], pts[i][1])
            print(pts[i + 1][0], pts[i + 1][1])
            break
    else:
        print('NO')