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 f() {
  cout << -1;
  exit(0);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void gcd2(long long a, long long &x, long long b, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
  } else {
    long long x1, y1;
    gcd2(b, y1, a % b, x1);
    x = x1;
    y = y1 - (a / b) * x1;
  }
}
int main() {
  long long a, b, c, x = 0, y = 0;
  cin >> a >> b >> c;
  if (a == 0) {
    x = 0;
    if (c % b == 0)
      y = c / b;
    else
      f();
  } else if (b == 0) {
    y = 0;
    if (c % a == 0)
      x = c / a;
    else
      f();
  } else {
    if (c % gcd(a, b) != 0)
      f();
    else {
      long long k = gcd(a, b);
      a /= k;
      b /= k;
      c /= k;
      long long x, y;
      gcd2(a, x, b, y);
      x *= c;
      y *= c;
      cout << -x << ' ' << -y << endl;
      return 0;
    }
  }
  cout << -x << ' ' << -y << endl;
  return 0;
}