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 OO = 0x3f3f3f3f, N = 2e5 + 5, mod = 1e9 + 7;
const double pi = acos(-1), eps = 1e-9;
pair<bool, pair<long long, long long>> e_gcd(long long r0, long long r1,
                                             long long c) {
  long long y1 = 1, x0 = 1, x1 = 0, y0 = 0, q, t;
  while (r1) {
    q = r0 / r1;
    t = r0 - q * r1;
    r0 = r1;
    r1 = t;
    t = x0 - q * x1;
    x0 = x1;
    x1 = t;
    t = y0 - q * y1;
    y0 = y1;
    y1 = t;
  }
  if (c % r0) return {0, {0, 0}};
  long long m = c / r0;
  x0 *= m;
  y0 *= m;
  return {1, {x0, y0}};
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  pair<bool, pair<long long, long long>> ans = e_gcd(a, b, -c);
  if (ans.first)
    cout << ans.second.first << " " << ans.second.second;
  else
    cout << -1;
  return 0;
}