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 PYTHON):

Solution:
def egcd(a, b):
    x,y, u,v = 0,1, 1,0
    while a != 0:
        q, r = b//a, b%a
        m, n = x-u*q, y-v*q
        b,a, x,y, u,v = a,r, u,v, m,n
    gcd = b
    return gcd, x, y


def linear_diophantine(a, b, c):
  d,x,y = egcd(a,b);
  if c%d:
    x=y=-1;
  else:
    x = c*x/d;
    y = c*y/d;
  return x,y

if __name__ == '__main__':
  a,b,c=map(long,raw_input().split());
  x,y=linear_diophantine(a,b,-c);
  if x==-1 and y==-1:
    print "-1"
  else:
    print x,y