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 gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void extend_Euclid(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return;
  }
  extend_Euclid(b, a % b, x, y);
  long long tmp = x;
  x = y;
  y = tmp - (a / b) * y;
}
int main() {
  long long a, b, c, x, y;
  ;
  while (cin >> a >> b >> c) {
    c = -c;
    long long g = gcd(a, b);
    if (c % g) {
      printf("-1\n");
      continue;
    }
    a /= g;
    b /= g;
    c /= g;
    extend_Euclid(a, b, x, y);
    cout << x * c << " " << y * c << endl;
  }
  return 0;
}