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;
void gcd_ex(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1, y = 0;
    return;
  }
  long long x1, y1;
  gcd_ex(b, a % b, y1, x1);
  x = x1;
  y = y1 - (a / b) * x1;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long sgn(long long a) {
  if (a >= 0) return 1;
  return -1;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  c = -c;
  if (a == 0) {
    if (c % b != 0) {
      cout << -1;
      return 0;
    }
    cout << 0 << ' ' << c / b;
    return 0;
  }
  if (b == 0) {
    if (c % a != 0) {
      cout << -1;
      return 0;
    }
    cout << c / a << ' ' << 0;
    return 0;
  }
  long long x, y;
  long long g = gcd(((a < 0) ? (-a) : (a)), ((b < 0) ? (-b) : (b)));
  if (c % g != 0) {
    cout << -1;
    return 0;
  }
  a /= g, b /= g, c /= g;
  gcd_ex(((a < 0) ? (-a) : (a)), ((b < 0) ? (-b) : (b)), x, y);
  cout << x * c * sgn(a) << ' ' << y * c * sgn(b);
  return 0;
}