CF1772B.Matrix Rotation

You have a matrix $2 \times 2$ filled with distinct integers. You want your matrix to become beautiful. The matrix is beautiful if the following two conditions are satisfied:

• in each row, the first element is smaller than the second element;
• in each column, the first element is smaller than the second element.

You can perform the following operation on the matrix any number of times: rotate it clockwise by $90$ degrees, so the top left element shifts to the top right cell, the top right element shifts to the bottom right cell, and so on:

Determine if it is possible to make the matrix beautiful by applying zero or more operations.

你有一个 $2 \times 2$ 的矩阵，其中填入了互不相同的整数。你希望该矩阵变为“优美的”。当且仅当满足以下两个条件时，矩阵是优美的：

• 每一行中，第一个元素小于第二个元素；
• 每一列中，第一个元素小于第二个元素。

你可以对矩阵执行任意多次如下操作：将其顺时针旋转 $90^\circ$，即左上角元素移至右上角，右上角元素移至右下角，依此类推：

请判断：是否可以通过执行零次或多次上述操作，使该矩阵变为优美的？

The first line contains one integer $t$ ($1 \le t \le 1000$) — the number of test cases.

Each test case consists of two lines. Each of those lines contains two integers — the elements of the corresponding row of the matrix. In each matrix, all four elements are distinct integers from $1$ to $100$.

第一行包含一个整数 $t$（$1 \le t \le 1000$）—— 测试用例的数量。

每个测试用例由两行组成。每行包含两个整数——对应矩阵行中的元素。在每个矩阵中，四个元素均为 $1$ 到 $100$ 之间的互不相同的整数。

For each test case, print YES if the matrix can become beautiful, or NO otherwise. You may print each letter in any case (YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).

对于每个测试用例，如果该矩阵可以变为优美的，则输出 YES；否则输出 NO。你可以以任意大小写形式输出每个字母（例如 YES、yes、Yes 均被视为肯定回答；NO、no、nO 均被视为否定回答）。