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 N = 5e6 + 5;
int a, b, c;
long long gcd(long long a, long long b, long long& x, long long& y) {
  if (!b) {
    x = 0;
    y = 1;
    return a;
  }
  long long x1, y1;
  long long d = gcd(b, a % b, x1, y1);
  x = y1 - (a / b) * x1;
  y = x1;
  return d;
}
int main() {
  scanf("%d%d%d", &a, &b, &c);
  long long x, y, d;
  d = gcd(a, b, x, y);
  if (c % d != 0)
    puts("-1");
  else
    cout << -y * c / d << " " << -x * c / d << endl;
}