Problem: A line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from  - 5·1018 to 5·1018 inclusive, or to find out that such points do not exist.

Input

The first line contains three integers A, B and C ( - 2·109 ≤ A, B, C ≤ 2·109) — corresponding coefficients of the line equation. It is guaranteed that A2 + B2 > 0.

Output

If the required point exists, output its coordinates, otherwise output -1.

Examples

Input

2 5 3


Output

6 -3

Solution (in PYTHON3):

Solution:
import sys

def solve():
    a, b, c = map(int, input().split())
    gcd, amul, bmul = egcd(a, b)
    if c % gcd != 0:
        print(-1)
        return
    first = amul * c//gcd
    second = bmul * c // gcd
    for i in range(-1, 2, 2):
        for j in range(-1, 2, 2):
            if a * first * i + b * second * j == - c:
                print(first * i, second * j)
                return
    print(-1)

def egcd(a, b):
    s = 0
    old_s = 1
    t = 1
    old_t = 0
    r = b
    old_r = a
    while r != 0:
        quotient = old_r // r
        (old_r, r) = (r, old_r - quotient * r)
        (old_s, s) = (s, old_s - quotient * s)
        (old_t, t) = (t, old_t - quotient * t)
    return (old_r, old_s, old_t)

if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
ans = solve()