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 gcd(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 = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
long long a, b, c, sa = 1, sb = 1, m;
int main() {
  cin >> a >> b >> c;
  if (a < 0) a = -a, sa = -1;
  if (b < 0) b = -b, sb = -1;
  bool pp = false;
  if (a > b) {
    long long w = a;
    a = b;
    b = w;
    pp = true;
  }
  long long x, y;
  m = gcd(a, b, x, y);
  if (pp) {
    long long w = x;
    x = y;
    y = w;
  }
  if (c % m != 0)
    cout << -1 << endl;
  else
    c /= m, cout << x * (-c) * sa << " " << y * (-c) * sb << endl;
  return 0;
}