Equal Task Assignment

In this problem, you are given two integers, (n) and (m). You need to determine whether it is possible to assign (m) tasks equally among (n) participants. More formally, if (m \mod n = 0), then each participant will receive (\frac{m}{n}) tasks; otherwise, output "Impossible".

Constraints: (1 \leq n, m \leq 10^5).

inputFormat

The input consists of two integers (n) and (m) separated by a space from standard input.

outputFormat

Output a single integer denoting the number of tasks assigned to each participant if the assignment is possible, otherwise print "Impossible" to the standard output.## sample

3 9

3