Problem: There is an infinite set generated as follows:
- is in this set.
- If is in this set, and both are in this set.
For example, when and , the five smallest elements of the set are:
- ,
- ( is in this set, so is in this set),
- ( is in this set, so is in this set),
- ( is in this set, so is in this set),
- ( is in this set, so is in this set).
Given positive integers , , , determine if is in this set.
Input Format: The input consists of multiple test cases. The first line contains an integer () — the number of test cases. The description of the test cases follows.
The only line describing each test case contains three integers , , () separated by a single space.
Output Format: For each test case, print "Yes" if is in this set, and "No" otherwise. You can print each letter in any case.
Note: In the first test case, is generated as follows:
- is in this set, so and are in this set;
- is in this set, so and are in this set;
- is in this set, so and are in this set.
Thus we can see is in this set.
The five smallest elements of the set in the second test case is described in statements. We can see that isn't among them.