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;
pair<long long, long long> extended_euclid(long long a, long long b) {
  if (b == 0) return make_pair(1, 0);
  pair<long long, long long> ab(a, b), x(0, 1), y(1, 0);
  while (ab.second) {
    long long quotient = ab.first / ab.second;
    ab = make_pair(ab.second, ab.first % ab.second);
    x = make_pair(x.second - quotient * x.first, x.first);
    y = make_pair(y.second - quotient * y.first, y.first);
  }
  return make_pair(x.second, y.second);
}
int main(void) {
  long long a, b, c;
  cin >> a >> b >> c;
  pair<long long, long long> x = extended_euclid(a, b);
  long long gcd = a * x.first + b * x.second;
  c *= -1;
  if (c % gcd != 0)
    cout << "-1";
  else
    cout << x.first * (c / gcd) << " " << x.second * (c / gcd);
  return 0;
}