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) {
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long gcd(long long a, long long b, long long c) {
  return gcd(abs(a), gcd(abs(b), abs(c)));
}
long long gcd2(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 = gcd2(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
int main() {
  ios_base::sync_with_stdio(false);
  long long a;
  cin >> a;
  ;
  long long b;
  cin >> b;
  ;
  long long c;
  cin >> c;
  ;
  if (a == 0) {
    if (c % b == 0) {
      cout << 0 << ' ' << -c / b;
    } else
      cout << -1;
    return 0;
  }
  if (b == 0) {
    if (c % a == 0) {
      cout << -c / a << ' ' << 0;
    } else
      cout << -1;
    return 0;
  }
  long long g = gcd(a, b, c);
  a /= g;
  b /= g;
  c /= g;
  if (gcd(a, b, a) > 1) {
    cout << -1;
    return 0;
  }
  long long x;
  long long y;
  gcd2(abs(a), abs(b), x, y);
  if (a < 0) x *= -1;
  if (b < 0) y *= -1;
  x *= -c;
  y *= -c;
  cout << x << ' ' << y;
}