Gcd

题号：NC256729
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
64bit IO Format: %lld

题目描述

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

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

$\bullet$ 2. Choose two elements $a,b (a \neq 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 \in 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 ().
The description of the test cases follows.
One line contains three integers ().

输出描述:

For each test case, output "YES" or "NO".

示例1

输入

复制

输出

复制

YES
NO
YES