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 solve(long long A, long long B, long long C) {
  if (B == 0) {
    return 0;
  }
  long long N = A % B;
  long long X = solve(B, N, C);
  long long Y = (-C - A * X) / B;
  if (A != 0) {
    Y %= A;
  }
  return Y;
}
int abs(int a) { return a > 0 ? a : -a; }
int _gcd(int a, int b) {
  if (b == 0) return a;
  return _gcd(b, a % b);
}
int A, B, C;
int main() {
  scanf("%d %d %d", &A, &B, &C);
  int gcd = _gcd(abs(A), abs(B));
  if (C % gcd == 0) {
    long long Y = solve(A, B, C);
    long long X = 0;
    if (A != 0) {
      X = (-B * Y - C) / A;
    }
    printf("%I64d %I64d\n", X, Y);
  } else {
    printf("-1\n");
  }
  return 0;
}