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 a, b, c, x, y;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
void exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1, y = 0;
    return;
  } else {
    exgcd(b, a % b, x, y);
    long long tep = x;
    x = y;
    y = tep - (a / b) * y;
  }
}
signed main() {
  cin >> a >> b >> c;
  c = -c;
  long long g = gcd(a, b);
  if (c % g != 0) {
    cout << "-1" << endl;
    return 0;
  }
  exgcd(a, b, x, y);
  cout << x * (c / g) << " " << y * (c / g) << endl;
  return 0;
}