B. Bitwise Reversion

You are given three non-negative integers 𝑥

, 𝑦

 and 𝑧

. Determine whether there exist three non-negative integers 𝑎

, 𝑏

 and 𝑐

 satisfying the following three conditions:

• 𝑎&𝑏=𝑥
• 𝑏&𝑐=𝑦
• 𝑎&𝑐=𝑧

where &

 denotes the bitwise AND operation.

Input

Each test contains multiple test cases. The first line contains the number of test cases 𝑡

 (1≤𝑡≤10

4

). The description of the test cases follows.

The first and only line of each test case contains three integers 𝑥

, 𝑦

 and 𝑧

 (0≤𝑥,𝑦,𝑧≤10

9

) — the target values of 𝑎&𝑏

, 𝑏&𝑐

 and 𝑎&𝑐

, respectively.

Output

For each test case, output "YES" if there exists three non-negative integers 𝑎

, 𝑏

, and 𝑐

 satisfying the above conditions, and "NO" otherwise.

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

Example

Input

Copy

5
1 1 1
3 2 6
4 8 12
9 10 12
12730 3088 28130

Output

Copy

YES
YES
NO
YES
NO

Note

In the first test case, 𝑎=3

, 𝑏=5

, and 𝑐=9

 satisfies the condition as 3&5=1

, 5&9=1

, and 3&9=1

.

In the second test case, 𝑎=7

, 𝑏=3

, and 𝑐=22

 satisfies the condition as 7&3=3

, 3&22=2

, and 7&22=6

.

In the third test case, it can be proven that there are no three non-negative integers 𝑎

, 𝑏

, and 𝑐

 such that 𝑎&𝑏=4

, 𝑏&𝑐=8

, and 𝑎&𝑐=12

.