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 int GCD(long long int u, long long int v) {
  while (v != 0) {
    long long int r = u % v;
    u = v;
    v = r;
  }
  return u;
}
long long int gcdExtended(long long int a, long long int b, long long int *x,
                          long long int *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int main() {
  long long int a, b, c;
  cin >> a >> b >> c;
  long long int x = GCD(a, b);
  if (c % x == 0) {
    long long int y = (c / abs(x));
    long long int n, m;
    long long int g = gcdExtended(a, b, &n, &m);
    long long int n1 = n * y;
    long long int m1 = m * y;
    if (a * n1 + b * m1 + c == 0)
      cout << n1 << " " << m1 << endl;
    else if (-a * n1 + b * m1 + c == 0)
      cout << -n1 << " " << m1 << endl;
    else if (a * n1 - b * m1 + c == 0)
      cout << n1 << " " << -m1 << endl;
    else
      cout << -n1 << " " << -m1 << endl;
  } else
    cout << -1 << endl;
  return 0;
}