Dots and Lines#1744
Vasya and Petya are playing the following game. Vasya draws points on a plane and announces the number . Petya has to determine whether it is possible to connect these points using lines, such that:
Each line connects exactly two points.
No line connects a point to itself.
For any pair of points, there is at most one line connecting them.
There exist two points and such that it is impossible to reach from by moving along the drawn lines (you may travel along lines in either direction).
If Petya answers correctly, he wins; otherwise Vasya wins.
Your task is to write a program that will help Petya always win.
The first line contains the integer — the number of test cases (1 \le K \le 1000). The following lines each contain two integers (1 \le N \le 10^9) and (0 \le M \le 10^9).
For each test case, output the correct answer on a separate line: "Yes" (if the answer is positive), or "No" (if the answer is negative).
Example 1