#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read() {
  int ret = 0, sgn = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') sgn = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    ret = ret * 10 + ch - '0';
    ch = getchar();
  }
  return ret * sgn;
}
inline void Out(int a) {
  if (a > 9) Out(a / 10);
  putchar(a % 10 + '0');
}
long long __gcd(long long a, long long b) {
  return b == 0 ? a : __gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / __gcd(a, b); }
long long qpow(long long a, long long b, long long mod) {
  if (a >= mod) a = a % mod + mod;
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a;
      if (ans >= mod) ans = ans % mod + mod;
    }
    a *= a;
    if (a >= mod) a = a % mod + mod;
    b >>= 1;
  }
  return ans;
}
int Fermat(int a, int p) { return qpow(a, p - 2, p); }
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  long long d = exgcd(b, a % b, x, y);
  long long z = x;
  x = y;
  y = z - y * (a / b);
  return d;
}
long long a, b, c;
int main() {
  scanf("%lld%lld%lld", &a, &b, &c);
  long long x, y;
  long long res = exgcd(a, b, x, y);
  if (c % res == 0)
    printf("%lld %lld\n", -x * c / res, -y * c / res);
  else
    puts("-1");
  return 0;
}

### Prompt

Please create a solution in Cpp to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read() {
  int ret = 0, sgn = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') sgn = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    ret = ret * 10 + ch - '0';
    ch = getchar();
  }
  return ret * sgn;
}
inline void Out(int a) {
  if (a > 9) Out(a / 10);
  putchar(a % 10 + '0');
}
long long __gcd(long long a, long long b) {
  return b == 0 ? a : __gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / __gcd(a, b); }
long long qpow(long long a, long long b, long long mod) {
  if (a >= mod) a = a % mod + mod;
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a;
      if (ans >= mod) ans = ans % mod + mod;
    }
    a *= a;
    if (a >= mod) a = a % mod + mod;
    b >>= 1;
  }
  return ans;
}
int Fermat(int a, int p) { return qpow(a, p - 2, p); }
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  long long d = exgcd(b, a % b, x, y);
  long long z = x;
  x = y;
  y = z - y * (a / b);
  return d;
}
long long a, b, c;
int main() {
  scanf("%lld%lld%lld", &a, &b, &c);
  long long x, y;
  long long res = exgcd(a, b, x, y);
  if (c % res == 0)
    printf("%lld %lld\n", -x * c / res, -y * c / res);
  else
    puts("-1");
  return 0;
}

```