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 num;
int a, b, c;
int gcd(long long a, long long b) {
  long long target = c;
  long long s0 = 1, t0 = 0, s1 = 0, t1 = 1;
  while (b != 0) {
    swap(a, b), swap(s0, s1), swap(t0, t1);
    long long q = b / a;
    b = b % a;
    s1 = s1 - q * s0;
    t1 = t1 - q * t0;
  }
  long long q = -target / a;
  if (target % a != 0)
    printf("-1\n");
  else
    printf("%lld %lld\n", q * s0, q * t0);
}
int main() {
  scanf("%d%d%d", &a, &b, &c);
  if (a == 0 and c % b == 0) {
    printf("0 %d\n", -c / b);
  } else if (b == 0 and c % a == 0) {
    printf("%d 0\n", -c / a);
  } else if (a == 0 or b == 0) {
    printf("-1");
  } else {
    gcd(a, b);
  }
  return 0;
}