There are $n$ cats and $n$ dogs, each numbered from $1$ to $n$. From their locations each of them can look at other cats and dogs. In particular the following is happening:
Something really bad will happen if a cat and a dog are looking at each other at the same time, so Koa the Koala will help to sort out this situation. She has to determine whether it is possible to arrange which are the target animals each animal is looking at, in such a way that:
Help her!
First line of the input contains one integer $t$ ($1 \le t \le 100$), the number of test cases. Then $t$ test cases follow.
The only line of each test case contains three integers $n$, $a$ and $b$ ($1 \le n \le 100$ ; $1 \le a, b \le n)$.
It is guaranteed that the sum of $n$ over all test cases does not exceed $100$ ($\sum n \le 100$).
For each test case:
Print "Yes" or "No" (without quotes), depending on whether such arrangement exists.
If the answer is "Yes":
If there are many possible arrangements print any.