Two water jugs

You have two jugs with capacities of $a$ and $b$ liters. Water is unlimited, and you may repeat the following three operations as many times as you like.

• Fill one jug to the top.
• Empty one jug completely.
• Pour water from one jug into the other, stopping when the source jug is empty or the receiving jug is full.

Write a program that decides whether you can reach a state where one of the two jugs holds exactly $c$ liters.

The first line contains the number of test cases $T$. ($1 \le T \le 10000$)

Each of the next $T$ lines contains one test case, given as three integers $a$, $b$, $c$. ($1 \le a, b, c \le 10^9$)

For each test case, print YES on its own line if exactly $c$ liters can be measured, and NO otherwise.

For $a = 5$, $b = 3$, $c = 4$, the following steps produce 4 liters.

• Fill $a$. ($a = 5$, $b = 0$)
• Pour $a$ into $b$. ($a = 2$, $b = 3$)
• Empty $b$, then pour $a$ into $b$. ($a = 0$, $b = 2$)
• Fill $a$. ($a = 5$, $b = 2$)
• Pour $a$ into $b$. ($a = 4$, $b = 3$)