As calculating division modulo m requires quite involved computations, we are interested in computing the result of division a / b modulo m for only the cases when a is divisible by b.
Input
The only line of the input contains 3 integers a (1 β€ a β€ ), b (1 β€ b β€ ), and m (1 β€ m β€ ).
Output
If a is divisible by b, the program should print the result of , otherwise, the program should print Impossible.