英文原题：题目来源：Apple | JXNUOJ

Apple

1000ms 262144K

描述：

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.

输入：

The first line contains a positive integer 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).

输出：

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

翻译：

苹果

描述：

在一个盒子里有一些苹果，这些苹果共有N个。你要将这些苹果分给M个人，并保证每个人都分到整数个苹果且每个人分到的苹果数目不同。如果可行则输出possible否则输出impossible。

输入：

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

随后T行每行输入俩个整数N,M（1<=N<=1000000,1<=m<=1000)。

输出：

每组数据输出一行，如果可行则输出possible反之输出impossible。