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 A, B, C;
long long gcd(long long a, long long b) {
  long long c = a;
  do {
    a = b;
    b = c;
    c = a % b;
  } while (c);
  return b;
}
pair<long long, long long> ext_gcd(long long a, long long b) {
  if (a % b == 0) {
    return make_pair(0, 1);
  }
  pair<long long, long long> pp = ext_gcd(b, a % b);
  return make_pair(pp.second, pp.first - pp.second * (a / b));
}
int main() {
  cin >> A >> B >> C;
  if (A == 0) {
    if (C % B == 0) {
      cout << 0 << " " << -C / B << endl;
    } else {
      cout << -1 << endl;
    }
    return 0;
  } else if (B == 0) {
    if (C % A == 0) {
      cout << -C / A << " " << 0 << endl;
    } else {
      cout << -1 << endl;
    }
    return 0;
  } else {
    long long g = gcd((((A) > 0) ? (A) : -(A)), (((B) > 0) ? (B) : -(B)));
    if (C % g != 0) {
      cout << -1 << endl;
      return 0;
    }
    pair<long long, long long> pp =
        ext_gcd((((A) > 0) ? (A) : -(A)) / g, (((B) > 0) ? (B) : -(B)) / g);
    long long cg = -C / g;
    long long v1 = pp.first * cg;
    long long v2 = pp.second * cg;
    if (A < 0) v1 = -v1;
    if (B < 0) v2 = -v2;
    cout << v1 << " " << v2 << endl;
  }
}