#include <bits/stdc++.h>
using namespace std;
long long x, y, d;
void Euklid(int a, int b) {
  if (!b) {
    x = 1;
    y = 0;
    d = a;
    return;
  }
  Euklid(b, a % b);
  int x1 = y;
  int x2 = x - (a / b) * y;
  x = x1;
  y = x2;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : b; }
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  int a;
  while (cin >> a) {
    int b;
    cin >> b;
    int c;
    cin >> c;
    Euklid(a, b);
    if (c % d) {
      cout << -1;
      return 0;
    }
    cout << x * (-c / d) << " " << y * (-c / d);
  }
  return 0;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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 x, y, d;
void Euklid(int a, int b) {
  if (!b) {
    x = 1;
    y = 0;
    d = a;
    return;
  }
  Euklid(b, a % b);
  int x1 = y;
  int x2 = x - (a / b) * y;
  x = x1;
  y = x2;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : b; }
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  int a;
  while (cin >> a) {
    int b;
    cin >> b;
    int c;
    cin >> c;
    Euklid(a, b);
    if (c % d) {
      cout << -1;
      return 0;
    }
    cout << x * (-c / d) << " " << y * (-c / d);
  }
  return 0;
}

```