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;
long long int a, b, c, d, x, y;
void ex_gcd(long long int a, long long int b, long long int& d,
            long long int& x, long long int& y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    ex_gcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
int main(int argc, char const* argv[]) {
  cin >> a >> b >> c;
  ex_gcd(a, b, d, x, y);
  if (c % d != 0)
    puts("-1");
  else
    cout << -x * (c / d) << " " << -y * (c / d) << endl;
  return 0;
}