编程题: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".
### Input:
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).
### Output:
For each test case output a line. If it can be done, output "possible"; otherwise output "impossible".
### Sample Input:
in
3
9 3
12 1
9 4
### Sample Output:
out
possible
possible
impossible
answer:若无答案欢迎评论
### Input:
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).
### Output:
For each test case output a line. If it can be done, output "possible"; otherwise output "impossible".
### Sample Input:
in
3
9 3
12 1
9 4
### Sample Output:
out
possible
possible
impossible
answer:若无答案欢迎评论