Problem Description

Given $n, m$, determine whether there exist two different numbers $x, y$ such that $1 \le x < y \le m$ and $n \bmod x = n \bmod y$.

Input Format

The input contains multiple independent queries.

The first line contains an integer $T$, representing the number of queries.

The next $T$ lines each contain two integers $n, m$, separated by a space, representing one query.

Output Format

Output $T$ lines. Each line corresponds to the result of one query. If such $x, y$ exist, output the word Yes; otherwise, output the word No.

3
1 2
5 2
999 99

No
No
Yes

Hint

For $20\%$ of the test cases, $T \le 100$, $n, m \le 1000$.

For $50\%$ of the test cases, $T \le 10000$, $n, m \le 10^5$.

For all test cases, $1 \le T \le 10^5$, $1 \le n \le 10^9$, $2 \le m \le 10^9$.

Lanqiao Cup 2022 National Contest, Group C, Problem C.

Translated by ChatGPT 5