Module: Nested conditional statement. Difficult conditions


Problem

14 /14


*In the bus

Problem

Fares for buses in our city — one ruble. However, not everything is so simple — each adult passenger has the right to carry no more than one child free of charge. This means that an adult passenger who brings k (\(k >0\)) children with him pays only k rubles: for one ticket for yourself and for (k-1) tickets for your children. Also, an adult can go without children, in which case he pays only one ruble. It is known that children cannot travel on the bus without an adult.
 
Help me calculate the minimum and maximum fares in rubles that bus passengers could pay.
 
Input
The input string contains two integers n and m (\(0 <= n,\ m <= 10^5\)) — the number of adults and the number of children on the bus, respectively.
 
Output
In your answer print two space-separated numbers — the minimum and maximum possible fare, if the trip is possible, otherwise print "Impossible"; (without quotes).

 

Examples
# Input Output
1 1 2 2 2
2 0 5 Impossible
3 2 2 2 3