Alice and Bob are very good friends and they always distribute all the eatables equally among themselves.

Alice has A chocolates and Bob has B chocolates. Determine whether Alice and Bob can distribute all the chocolates equally among themselves.

Note that:
It is not allowed to break a chocolate into more than one piece.
No chocolate shall be left in the distribution.

------ Input Format ------

• The first line of input will contain an integer T — the number of test cases. The description of T test cases follows.
• The first and only line of each test case contains two space-separated integers A and B, the number of chocolates that Alice and Bob have, respectively.

------ Output Format ------

For each test case, output on $a new line \texttt{YES}$ if Alice and Bob can distribute all the chocolates equally, else output $\texttt{NO}$.
The output is case insensitive, $i.e, \texttt{yes}, \texttt{YeS}, \texttt{yES}$ will all be accepted as correct answers when Alice and Bob can distribute the chocolates equally.

------ Constraints ------

$1 ≤ T ≤ 1000$
$1 ≤ A, B ≤ 10^{5}$

----- Sample Input 1 ------
4
1 1
1 3
1 2
1 4

----- Sample Output 1 ------
YES
YES
NO
NO

----- explanation 1 ------
Test case $1$: Both Alice and Bob already have equal number of chocolates, hence it is possible to distribute the chocolates equally among Alice and Bob.

Test case $2$: If Bob gives one of his chocolates to Alice, then both of them will have equal number of chocolates, i.e. $2$. So, it is possible to distribute the chocolates equally among Alice and Bob.

Test case $3$: There are total $3$ chocolates. These chocolates cannot be divided equally among Alice and Bob.

Test case $4$: Alice and Bob cannot have equal number of chocolates, no matter how they distribute the chocolates.

见题面

见题面