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 egcd(long long int a, long long int b, long long int &x,
                   long long int &y) {
  if (a % b == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long int newx, newy;
  long long int ret = egcd(b, a % b, newx, newy);
  x = newy;
  y = newx - newy * (a / b);
  return ret;
}
int main() {
  long long int a, b, x, y, c;
  cin >> a >> b >> c;
  if (c == 0) {
    cout << b << " " << -1 * a;
  } else if (b == 0) {
    if (a % c == 0)
      cout << -1 * a / c << " " << 1;
    else
      cout << -1;
  } else if (a == 0 && b == 0) {
    cout << "-1";
  } else {
    long long int d = egcd(a, b, x, y);
    if (c % d == 0)
      cout << x * (-c / d) << " " << y * (-c / d);
    else
      cout << "-1";
  }
  return 0;
}