Food Basket Preparation

In this problem, you are given three positive integers (n), (m), and (k) where (n) represents the number of families, (m) is the number of loaves of bread, and (k) is the number of bottles of water. Your task is to determine whether it is possible to create exactly (n) food baskets such that each basket contains at least one loaf of bread and one bottle of water. In other words, the answer is "Possible" if and only if (m \ge n) and (k \ge n); otherwise, the answer is "Impossible".

inputFormat

The input consists of a single line containing three space-separated integers: (n), (m), and (k).

outputFormat

Output a single line with either "Possible" if it is feasible to prepare the required number of food baskets, or "Impossible" otherwise.## sample

4 10 8

Possible