The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Line

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA 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·10^{18} to 5·10^{18} inclusive, or to find out that such points do not exist.

Input

The first line contains three integers *A*, *B* and *C* ( - 2·10^{9} ≤ *A*, *B*, *C* ≤ 2·10^{9}) — corresponding coefficients of the line equation. It is guaranteed that *A*^{2} + *B*^{2} > 0.

Output

If the required point exists, output its coordinates, otherwise output -1.

Examples

Input

2 5 3

Output

6 -3

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/27/2023 02:21:02 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|