Extended Euclidean Algorithm
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.
1 <= a, b <= 10^6
The first line contains 2 integer a and b
output integral value of x and y in a single line.