Description

Input

The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

A single line of test case contains four integers $s_1, s_2, s_3, s_4$ ($1 \le s_i \le 100$) — skill of the players. It is guaranteed that all the numbers in the array are different.

Output

For each testcase, output YES if the tournament is fair, or NO otherwise.

4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2

YES
NO
YES
NO

Note

Consider the example:

1. in the first test case, players $2$ and $3$ with skills $7$ and $9$ advance to the finals;
2. in the second test case, players $2$ and $4$ with skills $5$ and $9$ advance to the finals. The player with skill $6$ does not advance, but the player with skill $5$ advances to the finals, so the tournament is not fair;
3. in the third test case, players $1$ and $3$ with skills $5$ and $8$ advance to the finals;
4. in the fourth test case, players $1$ and $3$ with skills $6$ and $3$ advance to the finals. The player with skill $5$ does not advance, but the player with skill $3$ advances to the finals, so the tournament is not fair.