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 int x, y, z;
void gcd(long long int a, long long int b) {
  if (b == 0) {
    x = a;
    y = 1;
    z = 0;
  } else {
    gcd(b, a % b);
    swap(z, y);
    z = z - y * (a / b);
  }
}
int main() {
  long long int a, b, c;
  while (~scanf("%lld%lld%lld", &a, &b, &c)) {
    c = -c;
    gcd(a, b);
    if (c % x)
      printf("-1\n");
    else {
      printf("%lld %lld\n", y * c / x, z * c / x);
    }
  }
  return 0;
}