Party Invitations

Cedric is planning a party and wants to invite a certain number of his friends in a peculiar way. Given two integers \(N\) and \(M\), where \(N\) is the total number of friends and \(M\) is the number of friends he wishes to invite, determine if it is possible to invite exactly \(M\) friends.

The condition is simple: if \(M \leq N\), then it is Possible to select \(M\) friends; otherwise, it is Impossible.

inputFormat

The first line contains an integer (T) representing the number of test cases. Each of the following (T) lines contains two space-separated integers (N) and (M), where (N) is the total number of friends and (M) is the number Cedric wants to invite.

outputFormat

For each test case, output a single line containing either "Possible" if (M) is less than or equal to (N), or "Impossible" otherwise.## sample

5
5 3
4 2
3 3
6 7
8 5

Possible
Possible
Possible
Impossible
Possible