Hopefully Educational Rounds #1

#### Start

2019-08-08 07:20 UTC

## Hopefully Educational Rounds #1

#### End

2019-08-15 07:20 UTC
The end is near!
Contest is over.
Not yet started.
Contest is starting in -235 days 16:00:38

168:00:00

0:00:00

# Problem UJug Hard

You have two empty jugs and tap that may be used to fill a jug. When filling a jug from the tap, you can only fill it completely (i.e., you cannot partially fill it to a desired level, since there are no volume measurements on the jug).

You may empty either jug at any point.

You may transfer water between the jugs: if transferring water from a larger jug to a smaller jug, the smaller jug will be full and there will be water left behind in the larger jug.

Given the volumes of the two jugs, is it possible to have one jug with some specific volume of water?

## Input

The first line contains $T$, the number of test cases ($1 \leq T \leq 100\, 000$). Each test case is composed of three integers: $a$, $b$, and $d$, where $a$ and $b$ ($1 \leq a, b \leq 10\, 000\, 000$) are the volumes of the two jugs, and $d$ is the desired volume of water to be generated. You can assume that $d \leq \max (a,b)$.

## Output

For each of the $T$ test cases, output either Yes or No, depending on whether the specific volume of water can be placed in one of the two jugs.

Sample Input 1 Sample Output 1
3
8 1 5
4 4 3
5 3 4

Yes
No
Yes