E. Weird Knight
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

We have a weird knight on an infinite 2D-plane. In a move, the weird $$$(p,q)$$$-knight on $$$(x,y)$$$ can move to $$$(x+p,y+q),(x-p,y+q),(x-p,y+q),(x-p,y-q),(x+q,y+p),(x+q,y-p),(x-q,y+p),(x-q,y-p)$$$.

For example, the knight in a normal chess game is a $$$(2,1)$$$-knight by our definition.

Is it possible for the $$$(p,q)$$$-knight to move from $$$(0,0)$$$ to $$$(x,y)$$$ ?

Input

The first line contains a single integer $$$T$$$ $$$(1\le T\le 10^4)$$$— the number of test cases. The description of test cases follows. The first line of each test case contains 4 integers $$$p,q,x,y$$$ $$$(-10^{9}\le p,q,x,y\le 10^9)$$$.

Output

For each test case, print "Yes" if it's possible for the $$$(p,q)$$$-knight to move from $$$(0,0)$$$ to $$$(x,y)$$$. Otherwise, print "No".

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

Examples
Input
1
2 3 0 2
Output
YES
Input
1
1 3 5 10
Output
NO