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 egcd(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long d = egcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int a, b, c;
  cin >> a >> b >> c;
  if (c > 0) {
    a *= -1;
    b *= -1;
  } else {
    c *= -1;
  }
  if (a == 0) {
    if (c % b == 0) {
      cout << "0 " << c / b << endl;
    } else {
      cout << -1 << endl;
    }
    return 0;
  }
  if (b == 0) {
    if (c % a == 0) {
      cout << c / a << " 0" << endl;
    } else {
      cout << -1 << endl;
    }
    return 0;
  }
  long long x, y;
  long long f = egcd(a, b, x, y);
  if (c % f != 0) {
    cout << -1 << endl;
    return 0;
  }
  cout << x * (c / f) << ' ' << y * (c / f) << endl;
  return 0;
}