You have �N balls and �K boxes. You want to divide the �N balls into �K boxes such that:
- Each box contains ≥1≥1 balls.
- No two boxes contain the same number of balls.
Determine if it is possible to do so.
- The first line contains a single integer �T — the number of test cases. Then the test cases follow.
- The first and only line of each test case contains two space-separated integers �N and �K — the number of balls and the number of boxes respectively.
For each test case, output
YES if it is possible to divide the �N balls into �K boxes such that the conditions are satisfied. Otherwise, output
You may print each character of
NO in uppercase or lowercase (for example,
Yes will be considered identical).
4 3 4 30 3 2 2 1 1
NO YES NO YES
Test Case 1: It is not possible to divide the 33 balls into 44 boxes such that each box contains ≥1≥1 balls.
Test Case 2: One way to divide the 3030 balls into 33 boxes is the following: [5,9,16][5,9,16].
Test Case 3: It is not possible to divide the 22 balls into 22 boxes such that no two boxes contain the same number of balls.
Test Case 4: We can divide 11 ball into 11 box.