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) { return b ? gcd(b, a % b) : a; }
void ex_gcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return;
  }
  ex_gcd(b, a % b, x, y);
  long long tmp = x;
  x = y;
  y = tmp - (a / b) * y;
}
int main() {
  long long A, B, C;
  while (cin >> A >> B >> C) {
    C = -C;
    long long k = gcd(A, B);
    if (C % k)
      cout << "-1" << endl;
    else {
      A /= k, B /= k, C /= k;
      long long x, y;
      ex_gcd(A, B, x, y);
      x *= C;
      y *= C;
      cout << x << " " << y << endl;
    }
  }
  return 0;
}