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;
void ex_gcd(long long a, long long b, long long &d, long long &x,
            long long &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    ex_gcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long max(long long a) { return a > 0 ? a : -a; }
int main() {
  long long A, Afh, B, Bfh, C, x, y, z;
  while (cin >> A >> B >> C) {
    z = 0;
    if (A == 0) {
      if (C % B == 0) {
        x = 0;
        y = -C / B;
        cout << x << " " << y << endl;
      } else
        cout << -1 << endl;
    } else if (B == 0) {
      if (C % A == 0) {
        y = 0;
        x = -C / A;
        cout << x << " " << y << endl;
      } else
        cout << -1 << endl;
    } else {
      Afh = Bfh = 1;
      if (A < 0) Afh = -1;
      if (B < 0) Bfh = -1;
      if (C > 0) {
        Afh *= -1;
        Bfh *= -1;
      }
      A = max(A);
      B = max(B);
      C = max(C);
      long long g, X, Y;
      ex_gcd(A, B, g, X, Y);
      if (C % g != 0)
        cout << -1 << endl;
      else {
        x = X * (C / g) * Afh;
        y = Y * (C / g) * Bfh;
        cout << x << " " << y << endl;
      }
    }
  }
  return 0;
}