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;
const int MAX = 2e5 + 7;
class diophantine {
 public:
  long long a, b, c;
  long long x, y;
  diophantine(long long a, long long b, long long c) {
    this->a = a;
    this->b = b;
    this->c = c;
  }
  long long func(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 = func(b % a, a, x1, y1);
    x = y1 - (b / a) * x1;
    y = x1;
    return d;
  }
  long long gcd() {
    long long d = func(a, b, x, y);
    long long k = c / d;
    x = x * k;
    y = y * k;
    return d;
  }
};
long long a, b, c;
void func() {
  c = -c;
  diophantine d(a, b, c);
  long long g = d.gcd();
  if (c % g != 0) {
    cout << -1 << endl;
    return;
  }
  cout << d.x << " " << d.y << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> a >> b >> c;
  func();
  return 0;
}