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;
int extgcd(int a, int b, int& x, int& y) {
  int g = a;
  x = 1;
  y = 0;
  if (b != 0) {
    g = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  }
  return g;
}
int main() {
  int a, b, c;
  scanf("%d%d%d", &a, &b, &c);
  int x, y;
  int g = extgcd(a, b, x, y);
  if (c % g == 0) {
    cout << (-c / g) * (long long)x << ' ' << (-c / g) * (long long)y << endl;
  } else {
    cout << -1 << endl;
  }
  return 0;
}