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 eet(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 = eet(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int main() {
  long long int n, m, i, j, k, cnt = 0, sum = 0, mn = INT_MAX, ind,
                               rem = 1000000007, ok = 0, size, lcm,
                               mx = INT_MIN, diff, num, x, y, z, ee;
  int flag = 0, t = 1;
  string s, str, s1, s2, s3;
  char ch;
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  while (t--) {
    long long int a, b, c;
    cin >> a >> b >> c;
    c = -c;
    long long int GCD = eet(a, b, &x, &y);
    if (c % GCD != 0) {
      cout << -1;
      return 0;
    }
    long long int mul = c / GCD;
    cout << x * mul << " " << y * mul;
    cout << endl;
  }
}