翻译no. 1

Apple

描述：

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 integerT(1≤T≤5)T(1≤T≤5)- the number of test cases.

In each of the following TT lines there are two positive integers N,M.(1≤N≤1000000,1≤M≤1000)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个人,要求每个人必须被分到正整数T(1<=T<=5)个,并且每个人必须分配到不同数量的苹果,如果可以分配则输出possible,不能则输出impossible

输入

第一行包含一个正整数T(1<=T<=5),表示测试用例数量

接下来T行输入两个正整数N,M(1≤N≤1000000,1≤M≤1000)

输出

每次测试输出一行,如果可以分配,输出possible,否则输出impossible.