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

Solution:
#include <bits/stdc++.h>
long long aa(long long b) { return b < 0 ? -b : b; }
long long euclid(long long a, long long b, long long &x, long long &y) {
  if (b) {
    int d = euclid(b, a % b, y, x);
    y -= x * (a / b);
    return d;
  } else {
    x = 1;
    y = 0;
    return a;
  }
}
long long mx = 5000000000000000000LL;
int main() {
  long long a, b, x, y, c;
  scanf("%I64d%I64d%I64d", &a, &b, &c);
  if (!a) {
    if (c % b == 0) {
      printf("%I64d %I64d\n", (long long)0, (long long)-c / b);
    } else {
      puts("-1");
    }
    return 0;
  }
  if (!b) {
    if (c % a == 0) {
      printf("%I64d %I64d\n", (long long)-c / a, (long long)0);
    } else {
      puts("-1");
    }
    return 0;
  }
  long long g = euclid(a, b, x, y);
  if (c % g == 0) {
    c /= g;
    a /= g;
    b /= g;
    g = euclid(a, b, x, y);
    long long m = -c / g;
    x *= m;
    y *= m;
    if (aa(x) > mx || aa(y) > mx) {
      puts("-1");
    } else {
      printf("%I64d %I64d\n", x, y);
    }
  } else {
    puts("-1");
  }
}