Universal Cup Judging System

Universal Cup

Time Limit: 1.0 s Memory Limit: 1024 MB Total points: 100 Hackable ✓
Statistics

Given integers $a, b, c$, you can perform one of the following operations each time:

  • $a \leftarrow a + b$
  • $a \leftarrow a \oplus b$

where $\oplus$ represents the binary XOR operation.

You can perform any number of operations, and you want to know if you can ultimately make $a$ equal to $c$.

Input

A single test case contains multiple data sets.

The first line of the input is the number of data sets $T$ ($1 \le T \le 10^3$), representing the number of data sets in this test case.

For each data set, there is a line with three integers $a, b, c$ ($0 \le a, c \le 10^{18}, 1 \le b \le 1000$).

It is guaranteed that in a single test case, $\sum b^2 \le 10^6$.

Output

For each data set, if it is possible to ultimately make $a$ equal to $c$, output "YES"; otherwise, output "NO".

Examples

Input 1

5
1 6 7
7 5 13
8 3 16
7 6 17
2 7 8

Output 1

YES
NO
YES
YES
NO

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.