问题 G: Gcd

Initially, you have a set S={x,y}S=\{x,y\}S={x,y} (x≠y)(x \neq y )(x≠y). Then you have two operations:

$\bullet$ 1. Choose two elements $a,b(a\ne b)$ from
set $S$, insert $a-b$ to the set.

$\bullet$ 2. Choose two elements a,b(a≠b)a,b (a \neq b)a,b(a≠b) from
set $S$, insert $\gcd (|a|,|b|)$ to the set.

We define $|a|$ as the absolute value of $a$.

We define $\gcd (a,b)$ as the greatest common divisor of $a$ and $b$.

Specially, $\gcd (a,0)=\gcd (0,a)=a$.

You task is making z∈Sz \in Sz∈S after several operations.

If possible, print "YES". Otherwise, print "NO".

Each test contains multiple test cases. The first line contains the number of test cases $T$(1≤T≤1051 \le T \le 10^51≤T≤105).
The description of the test cases follows.
One line contains three integers x,y,zx, y , zx,y,z(0≤x,y,z≤109, x≠y0 \le x, y,z\le 10^9, \ x \neq y0≤x,y,z≤10⁹, x≠y).

3
2 4 2
2 4 1
5 6 1

YES
NO
YES