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:
#Se resuelve con el Algoritmo de Euclides o el Algoritmo extendido de Euclides 

def main():
    a, b, c = map(int, input().split())
    
    x, x1 = 1, 0
    y, y1 = 0, 1
    
    while b != 0: #Se encuentra el mínimo común divisor y se define en "a"
        q = a//b
        a, b = b, a % b
        x, x1 = x1, x - q * x1
        y, y1 = y1, y - q * y1
    
    if c % a == 0:
        if -5 * 10 ** 18 <= x <= 5 * 10 ** 18 and -5 * 10 ** 18 <= y <= 5 * 10 ** 18: print(x*(-c//a), y*(-c//a))
        else: print(-1)
    else: print(-1)

if __name__ == "__main__":
    main()