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