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;
const int oo = 1e9 + 7;
const int maxn = 1e6 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
void solve(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return;
  }
  solve(b, a % b, x, y);
  long long t;
  t = x;
  x = y;
  y = t - (a / b) * y;
  return;
}
int main() {
  long long x, y, a, b, c, son;
  while (~scanf("%lld %lld %lld", &a, &b, &c)) {
    son = gcd(a, b);
    if (c % son) {
      printf("-1\n");
      continue;
    }
    a /= son;
    b /= son;
    c /= son;
    c = -c;
    solve(a, b, x, y);
    printf("%lld %lld\n", x * c, y * c);
  }
  return 0;
}