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, long long &x1, long long &y1) {
  if (a == 0) {
    x1 = 0;
    y1 = 1;
    return b;
  } else {
    long long x2 = 0, y2 = 0, g = gcd(b % a, a, x2, y2);
    y1 = x2;
    x1 = y2 - (b / a) * x2;
    return g;
  }
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  if (a == 0) {
    if (c % b != 0) {
      cout << -1 << endl;
    } else {
      cout << 0 << ' ' << -c / b << endl;
    }
    return 0;
  }
  if (b == 0) {
    if (c % a != 0) {
      cout << -1 << endl;
    } else {
      cout << -c / a << ' ' << 0 << endl;
    }
    return 0;
  }
  long long x = 0, y = 0, g = gcd(a, b, x, y);
  if (c % g != 0) {
    cout << -1 << endl;
    return 0;
  }
  cout << x * (-c / g) << ' ' << y * (-c / g) << endl;
  return 0;
}