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 inf = 2000000000;
long long gcd(long long first, long long second) {
  if (first > second) swap(first, second);
  while (second) {
    second %= first;
    swap(first, second);
  }
  return first + second;
}
long long exgcd(long long a, long long b, long long &first, long long &second) {
  if (a == 0) {
    first = 0;
    second = 1;
    return b;
  }
  long long ans = exgcd(b % a, a, first, second);
  long long oldy = second;
  second = first;
  first = oldy - (b / a) * first;
  return ans;
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  long long a, b, c;
  cin >> a >> b >> c;
  if (!c) {
    cout << "0 0";
    return 0;
  }
  long long first, second;
  bool sw = 0, sga = 0, sgb = 0, sgc = 0;
  if (a < 0) {
    a = -a;
    sga = 1;
  }
  if (b < 0) {
    b = -b;
    sgb = 1;
  }
  if (c > 0) {
    c = -c;
    sgc = 1;
  }
  if (a > b) {
    swap(a, b);
    sw = 1;
  }
  long long g = exgcd(a, b, first, second);
  if (c % g == 0) {
    if (sw) swap(first, second);
    first *= abs(c) / g;
    second *= abs(c) / g;
    if (sgc) {
      first = -first;
      second = -second;
    }
    if (sga) {
      first = -first;
    }
    if (sgb) {
      second = -second;
    }
    cout << first << " " << second;
  } else {
    cout << "-1";
  }
}