Apple（https://acs.jxnu.edu.cn/problem/ICPCJX2020B）

描述：

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)- 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（1<=T<=5）代表着测试数据的数量.

接下来T行每行有两个正整数N,M（1<=N<=1000000,1<=M<=1000)

输出：每一行对应一个输出，如果方案可行，输出possible,否则输出impossible