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>
using namespace std;
long long x, y, cox, coy;
long long gcd(long long a, long long b) {
  while (true) {
    a %= b;
    if (a == 0) return b;
    b %= a;
    if (b == 0) return a;
  }
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
bool euclid(long long a, long long b) {
  if (b > a) {
    long long t = a;
    a = b;
    b = t;
  }
  if (a % b == 0) {
    return true;
  }
  long long q = a / b;
  long long r = a - q * b;
  if (euclid(b, r)) {
    cox = a;
    coy = b;
    x = 1;
    y = -a / b;
  } else {
    if (r == cox) {
      cox = a;
      y += x * (-q);
    } else {
      coy = a;
      x += y * (-q);
    }
  }
  return false;
}
int main() {
  long long a, b, c;
  bool aneg = false, bneg = false;
  scanf("%I64d %I64d %I64d", &a, &b, &c);
  if (a == 0) {
    if (c == 0 || c % b == 0) {
      printf("%I64d %I64d\n", 0LL, -c / b);
    } else {
      printf("-1\n");
    }
    return 0;
  }
  if (b == 0) {
    if (c == 0 || c % a == 0) {
      printf("%I64d %I64d\n", -c / a, 0LL);
    } else {
      printf("-1\n");
    }
    return 0;
  }
  long long g = gcd(a, b);
  if (g < 0) g *= -1;
  if (c % g != 0) {
    printf("-1\n");
    return 0;
  }
  if (a % b == 0) {
    printf("%I64d %I64d\n", 0LL, -c / b);
    return 0;
  }
  if (b % a == 0) {
    printf("%I64d %I64d\n", -c / a, 0LL);
    return 0;
  }
  if (c == 0) {
    printf("%I64d %I64d\n", lcm(a, b) / a, -lcm(a, b) / b);
    return 0;
  }
  if (a < 0) {
    aneg = true;
    a *= -1;
  }
  if (b < 0) {
    bneg = true;
    b *= -1;
  }
  a /= g;
  b /= g;
  c /= g;
  euclid(a, b);
  if (a * x + b * y == 1) {
    printf("%I64d %I64d\n", (aneg ? -1 : 1) * x * (-c),
           (bneg ? -1 : 1) * y * (-c));
  } else {
    printf("%I64d %I64d\n", (aneg ? -1 : 1) * y * (-c),
           (bneg ? -1 : 1) * x * (-c));
  }
  return 0;
}