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 double PI = 2.0 * acos(0.0);
const int MOD = 1e9 + 7;
const int oo = MOD << 1;
long long gcd(long long x, long long y) { return !y ? x : gcd(y, x % y); }
long long ee(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1, y = 0;
    return a;
  }
  long long tx, ty, g = ee(b, a % b, tx, ty);
  x = ty;
  y = tx - (a / b) * ty;
  return g;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y, g = ee(a, b, x, y);
  if (c % g)
    puts("-1");
  else
    cout << -(c / g) * x << " " << -(c / g) * y << '\n';
  return 0;
}