# Linear Diophantine Equation

medium

You have been given three Integers a, b and k. you need to find an integral solution of x and y such that a*x + b*y= k * gcd(a,b). It can be proven that solution always exist.

## Constraints

1 <= a, b, k <= 10^6

## Format

### Input

The first line contains 3 integer a, b and k.

### Output

output integral value of x and y in a single line.

## Example

Sample Input

3 5 8

### Sample Output

16 -8

Question Video