A maniac has mixed poison in one of the n lunch boxes placed in a single row. The police department has assigned you to find the lunch box containing the poison. You have m hamsters with you. A hamster will die within 15 minutes on eating a lunch box containing the poison. You task is to find the poisoned lunch box within 15 minutes. Print "YES" if it is possible, else print "NO".
Note- All the hamsters will eat simultaneously. Each hamster can eat 0 or more number of lunch boxes. Also assume that It takes negligible time to eat a lunch box.
INPUT
First line of input contains t , the number of test cases. The next t lines contains two space separated integers n and m, denoting the number of lunch boxes and the hamsters respectively.
OUTPUT
Print the answer to the problem
CONSTRAINTS
1≤t≤106
1 <= n <= 10^18
1≤m≤n
Case 2
Let the first hamster eat the contents of lunch box 1 and 3. Second hamster eat the content of lunch box 2 and 3. If only the first hamster dies, box 1 was poisoned. If only the second hamster dies, box 2 was poisoned. If both of them die, box 3 was poisoned.