2.15英语翻译打卡

链接：Apple | JXNUOJ

There are a box of apples,which contains Napples. You're going to give them to M person. It is required that everyone must be given a positive integer apple, and no one must have the same amount. If it can be done, output possible; otherwise output impossible.

一盒苹果，有N个，分给M个人，要求是每个人必须分到证书个苹果，所有人分到的数量不同，如果可以做到，输出 possible,否则输出impossible.

输入：

The first line contains a positive integerT(1≤T≤5)T(1≤T≤5)- the number of test cases.

In each of the following T lines there are two positive integers N,M.(1≤N≤1000000,1≤M≤1000)N,M.(1≤N≤1000000,1≤M≤1000).

第一行输入T表示有T组测试数据。

接下来的T行包括两个数N，M

输出：

For each test case output a line. If it can be done, output possible; otherwise output impossible.

可以做到输出 possible; 否则输出 impossible.

样例输入：

3
9 3
12 1
9 4

样例输出：

possible
possible
impossible