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 extgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long k = extgcd(b, a % b, x, y);
  long long xprev = x;
  x = y;
  y = xprev - (a / b) * y;
  return k;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y, d;
  int flag = 0;
  if (a < b) {
    swap(a, b);
    flag = 1;
  }
  d = extgcd(a, b, x, y);
  if ((-c) % d != 0)
    cout << "-1" << endl;
  else {
    int k = (-c) / d;
    if (flag == 0)
      cout << x * k << " " << y * k << endl;
    else
      cout << y * k << " " << x * k << endl;
  }
  return 0;
}