Leo is training his martial arts in byteland's dojo.
The dojo is a rectangular ( n × m ) area with a pit of death, a square located at (i, j), where 1 <= i <= n, and 1 <= j <= m.
Every night, battles are very hard and the dojo is destructed, and reconstructed during the day around the pit.
Every evening, Leo's first mission is to make in place tatamis ( 2 × 1 ) in the new dojo.
Tatamis should cover the whole dojo except the pit of death.
Sometimes it's possible, sometimes not!

Input

The input begins with the number T of test cases in a single line.
In each of the next T lines there are four integers n, m, i and j.

Output

For each test case, print the answer of the problem : "Possible." or "Impossible.".

Example

Input:
2
3 3 2 2
3 3 1 2

Output:
Possible.
Impossible.

Constraints

1 <= T <= 1 000
1 <= i <= n <= 32
1 <= j <= m <= 10²⁰⁰⁰

Edit 2017-02-11 : 0.15s as TL, alongside the compiler changes.