Horsey

A herd of horseys is heading to the International Olympiad for Horses in Teams (IOHT).

They are currently positioned at cell $(0, 0)$ on a rectangular board of size $N \times M$. They can move only by making L-shaped jumps: $W$ tiles in one direction (either horizontal or vertical) and then $H$ tiles in a perpendicular direction.

Their goal is to reach the cell where the IOHT is held. However, they do not know its location in advance. They ask for your help to determine whether it is possible for them to visit every cell on the board using only these L-shaped jumps.

Input data

The first line of the input file contains a single integer $T$, the number of test cases. $T$ test cases follow, each on a new line.

Each test case consists of:

• a line containing integers $N$, $M$, $H$, and $W$.

Output data

The output file must contain $T$ lines, each consisting of a single string: the $i$-th line must be YES if it is possible to visit every cell in the $i$-th test case, and NO otherwise.

Constraints and clarifications

• $1 \leq T \leq 1000$.
• $2 \leq N, M \leq {10}^{18}$.
• $1 \leq H, W \leq {10}^{18}$.

Example 1

stdin

1
4 4 3 2

stdout

NO

Explanation

In the first sample case, not every cell is reachable using only $3 \times 2$ L-shaped moves. All reachable cells are circled in red in the figure below.

Example 2

stdin

2
2 2 5 7
8 8 1 2

stdout

NO
YES

Explanation

In the second sample case:

• On the $2 \times 2$ board, the horseys cannot make any moves, so not all cells are reachable.
• On the $8 \times 8$ board, it can be shown that all cells are reachable.