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:
"""
Codeforces
7C - Line
http://codeforces.com/contest/7/problem/C

Héctor González Belver
../07/2018
"""
import sys

def Bezout_identity(a, b):
  #Find integers x and y (Bezout coefficients) ==> ax + by = gcd(a,b)

  #Extendend Euclidean algorithm
  r = b
  x, x1 = 1, 0
  y, y1 = 0, 1
  while r:
    q, r = divmod(a, b) 
    a, b = b, r
    x, x1 = x1, x - x1 * q
    y, y1 = y1, y - y1 * q

  return a, x, y
  

def main():
  a, b, c = map(int, sys.stdin.readline().strip().split())

  #Linear Diophantine equations ==> Ax + By = C (A(A=a, B=b and C=-c))
  #It has a solution (where x and y are integers) if and only if C is a multiple of the greatest common divisor of A and B. 
  
  gcd_a_b, bezout_x, bezout_y = Bezout_identity(a, b)
  #if c is multiple of gcd(a,b)
  # ==> one solution is (-c/gcd(a,b) * bezout_coeff_x, -c/gcd(a,b) * bezout_coeff_y)
  # else no integer solution
  if c%gcd_a_b:
    sys.stdout.write('-1' + '\n')
  else:
    d = -c//gcd_a_b
    sys.stdout.write(str(bezout_x * d) + ' ' + str(bezout_y * d) + '\n')


if __name__ == '__main__': 
  main()