Apple
题号:NC213980
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 128 M,其他语言256 M
64bit IO Format: %lld

题目描述

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".

示例1

输入

复制
3
9 3
12 1
9 4

输出

复制
possible
possible
impossible