# Extended Euclidean Algorithm

medium

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

## Constraints

1 <= a, b <= 10^6

## Format

### Input

The first line contains 2 integer a and b

### Output

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

## Example

### Sample Output

Question Video