Simple Division Modulo m
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.
Examples
Input | Output |
|---|---|
3 8 5 | Impossible |
8 2 3 | 1 |
6 2 3 | 0 |
Explanation
3 is not divisible by 8 ⇒ Impossible
8 / 2 = 4 ⇒ 4 mod 3 = 1
6 / 2 = 3 ⇒ 3 mod 3 = 0
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB