翻译（12）

题目：Apple | JXNUOJ

描述：

There are a box of apples,which contains N apples. 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)- 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).

第一行包括一个正整数T(1≤T≤5)，测试的组数。

接下来的T行，每行两个正整数N，M.(1≤N≤1000000,1≤M≤1000)

输出：

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

每组数据输出一行。如果能做到，输出 possible，否则输出 impossible。