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> gcd(long long a, long long b) {
  if (b == 0) return {1, 0};
  auto s = gcd(b, a % b);
  return {s.second, s.first - a / b * s.second};
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  auto s = gcd(a, b);
  long long d = s.first * a + s.second * b;
  if (c % d == 0) {
    cout << (-s.first * c / d) << " " << (-s.second * c / d) << endl;
  } else {
    cout << (-1) << endl;
  }
  return 0;
}