#include <bits/stdc++.h>
using namespace std;
long long tx, ty;
long long ta, tb;
char last;
long long mabs(long long x) {
  if (x > 0)
    return x;
  else
    return -x;
}
void norm() {
  if (mabs(tx) >= 2000000000) {
    long long tmp = (tx + tb - 1) / tb;
    tx -= tmp * tb;
    ty += tmp * ta;
  }
  if (mabs(ty) >= 2000000000) {
    long long tmp = (ty + ta - 1) / ta;
    tx += tmp * tb;
    ty -= tmp * ta;
  }
}
long long gcd(long long a, long long b) {
  if (a) {
    long long ret = gcd(b % a, a);
    if (last) {
      tx = 1;
      ta = a;
      tb = a;
      ty = -b / a;
      last--;
    } else {
      long long nx = ty, ny = (-b / a * ty + tx);
      tx = nx;
      ta = a;
      ty = ny;
      tb = b;
      norm();
    }
    return ret;
  } else {
    last = 2;
    return b;
  }
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long d = gcd(a, b);
  if (c % d != 0)
    cout << -1;
  else if (a && b && a % b && b % a) {
    tx *= -c / d;
    ty *= -c / d;
    cout << ty << " " << tx;
  } else if (a && !(b % a)) {
    cout << -c / a << " " << 0;
  } else {
    cout << 0 << " " << -c / b;
  }
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long tx, ty;
long long ta, tb;
char last;
long long mabs(long long x) {
  if (x > 0)
    return x;
  else
    return -x;
}
void norm() {
  if (mabs(tx) >= 2000000000) {
    long long tmp = (tx + tb - 1) / tb;
    tx -= tmp * tb;
    ty += tmp * ta;
  }
  if (mabs(ty) >= 2000000000) {
    long long tmp = (ty + ta - 1) / ta;
    tx += tmp * tb;
    ty -= tmp * ta;
  }
}
long long gcd(long long a, long long b) {
  if (a) {
    long long ret = gcd(b % a, a);
    if (last) {
      tx = 1;
      ta = a;
      tb = a;
      ty = -b / a;
      last--;
    } else {
      long long nx = ty, ny = (-b / a * ty + tx);
      tx = nx;
      ta = a;
      ty = ny;
      tb = b;
      norm();
    }
    return ret;
  } else {
    last = 2;
    return b;
  }
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long d = gcd(a, b);
  if (c % d != 0)
    cout << -1;
  else if (a && b && a % b && b % a) {
    tx *= -c / d;
    ty *= -c / d;
    cout << ty << " " << tx;
  } else if (a && !(b % a)) {
    cout << -c / a << " " << 0;
  } else {
    cout << 0 << " " << -c / b;
  }
  return 0;
}

```