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;
int64_t gcdExtended(int64_t a, int64_t b, int64_t *x, int64_t *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  int64_t x1, y1;
  int64_t gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int64_t A, B, C;
  cin >> A >> B >> C;
  int64_t x, y;
  int64_t G = gcdExtended(A, B, &x, &y);
  if (C * x % G || C * y % G)
    cout << "-1";
  else
    cout << -C / G * x << ' ' << -C / G * y << '\n';
  return 0;
}