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;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const double EPS = 1e-8;
const int MOD = 1e9 + 7;
template <typename T>
void cmin(T &x, T y) {
  if (y < x) x = y;
}
template <typename T>
void cmax(T &x, T y) {
  if (y > x) x = y;
}
long long qpow(long long x, long long n, long long mod = MOD) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}
long long sq(long long x) { return x * x; }
namespace Solver {
void InitOnce() { int t; }
long long a, b, c;
namespace ExtendedEuclidAlgorithm {
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), t;
  t = x, x = y, y = t - a / b * y;
  return d;
}
pair<long long, long long> res;
int LCE1(long long a, long long b, long long c) {
  long long x, y, d = exgcd(a, b, x, y), t = b / d;
  if (c % d != 0) return -1;
  long long x0 = ((x % t) * (c / d % t) % t + t) % t, y0 = (c - a * x0) / b;
  res = pair<long long, long long>(x0, y0);
  return 1;
}
long long LCE2(long long a, long long r, long long m) {
  long long x, y, d = exgcd(a, m, x, y), t = m / d;
  if (r % d != 0) return -1;
  long long x0 = ((x % t) * (r / d % t) % t + t) % t;
  return x0;
}
long long inv(long long a, long long m) {
  long long x, y, d = exgcd(a, m, x, y);
  if (d != 1) return -1;
  long long x0 = (x % m + m) % m;
  return x0;
}
}  // namespace ExtendedEuclidAlgorithm
void Read() {
  int res = scanf("%lld%lld%lld", &a, &b, &c);
  if (res == -1) exit(0);
}
void Solve() {
  if (b == 0) {
    if (-c % a != 0) {
      puts("-1");
      return;
    }
    printf("%lld 0\n", (-c) / a);
    return;
  }
  if (a == 0) {
    if (-c % b != 0) {
      puts("-1");
      return;
    }
    printf("0 %lld\n", (-c) / b);
    return;
  }
  int res1 = ExtendedEuclidAlgorithm::LCE1(a, b, -c);
  if (res1 == -1) {
    puts("-1");
    return;
  }
  printf("%lld %lld\n", ExtendedEuclidAlgorithm::res.first,
         ExtendedEuclidAlgorithm::res.second);
}
}  // namespace Solver
int main() {
  Solver::InitOnce();
  while (true) {
    Solver::Read();
    Solver::Solve();
  }
  return 0;
}