C. Rare Function
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Define $$$f(x, y) = \begin{cases} 1 & \text{if } x \bmod y = 1 \\ 0 & \text{otherwise} \end{cases}$$$

You are given two integers $$$n$$$ and $$$m$$$. Check whether $$$f(m,1) + f(m,2) + \ldots + f(m,n)$$$ reaches the maximum.

In other words, for all $$$i \in [1, +\infty)$$$, $$$$$$f(m,1) + f(m,2) + \dots + f(m,n) \ge f(i,1) + f(i,2) + \dots + f(i,n)$$$$$$

Input

The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10^3$$$). The description of the test cases follows.

A single line of each test case contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n, m \le 10^9$$$).

Output

For each test case, print "YES" if the inequality holds for every $$$i$$$; otherwise, print "NO".

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as a positive answer).

Example
Input
3
3 7
1 2
2 4
Output
YES
YES
NO
Note

In the first test case, $$$f(m,1)+f(m,2)+f(m,3)=f(7,1)+f(7,2)+f(7,3)=0+1+1=2$$$, which reaches the maximum.