A. Photos in Flight
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vadim loves traveling very much. This time he decided to take wonderful photographs of two cities from the airplane and publish them on social media. In order for the photographs to turn out well, the airplane must fly directly over the center of each city.

The center of the first city is located at point $$$(x_1, y_1)$$$, and the center of the second city is located at point $$$(x_2, y_2)$$$, with both cities located above the line $$$y = 0$$$ (that is, $$$y_1, y_2 \ge 1$$$).

The airplane that Vadim will fly on will take off from a runway located on the line $$$x = 0$$$. The airplane takes off from point $$$(0, 0)$$$ in the direction of the runway towards increasing $$$y$$$ coordinates, or towards decreasing $$$y$$$ coordinates, while keeping the $$$x$$$ coordinate unchanged.

The airplane can make a turn no more than once at any moment during its flight (including at the moment of takeoff) — flying in a straight line in any direction from its current point.

Vadim is interested in whether he will be able to take successful photographs of the two cities. Please note that he can fly over the cities in any order.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10^4$$$). The description of the test cases follows.

The only line of each test case contains four integers $$$x_1$$$, $$$y_1$$$, $$$x_2$$$, and $$$y_2$$$ ($$$-10^9 \le x_1, x_2 \le 10^9$$$, $$$1 \le y_1, y_2 \le 10^9$$$) — the coordinates of the center of the first city and of the second city, respectively. It is guaranteed that $$$(x_1, y_1) \ne (x_2, y_2)$$$, that is, the centers of the cities do not coincide.

Output

For each test case, output "Yes" (without quotes) if Vadim will be able to take successful photographs; otherwise, output "No" (without quotes).

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.

Example
Input
5
1 4 3 3
-1 1 -4 4
2 1 3 2
8 10 8 1
-10 5 16 1
Output
Yes
Yes
Yes
No
No
Note

In the first test case, the flight path of the airplane (highlighted in orange) can be as follows:

In the second test case, the airplane can turn at the moment of takeoff:

In the third test case, the flight path of the airplane can be as follows:

In the fourth test case, there is no route on which Vadim can take successful photographs.