codeforces#P1971C. Clock and Strings

Clock and Strings

Description

There is a clock labeled with the numbers 11 through 1212 in clockwise order, as shown below.

In this example, (a,b,c,d)=(2,9,10,6)(a,b,c,d)=(2,9,10,6), and the strings intersect.

Alice and Bob have four distinct integers aa, bb, cc, dd not more than 1212. Alice ties a red string connecting aa and bb, and Bob ties a blue string connecting cc and dd. Do the strings intersect? (The strings are straight line segments.)

The first line contains a single integer tt (1t59401 \leq t \leq 5940) — the number of test cases.

The only line of each test case contains four distinct integers aa, bb, cc, dd (1a,b,c,d121 \leq a, b, c, d \leq 12).

For each test case, output "YES" (without quotes) if the strings intersect, and "NO" (without quotes) otherwise.

You can output "YES" and "NO" in any case (for example, strings "yEs", "yes", and "Yes" will be recognized as a positive response).

Input

The first line contains a single integer tt (1t59401 \leq t \leq 5940) — the number of test cases.

The only line of each test case contains four distinct integers aa, bb, cc, dd (1a,b,c,d121 \leq a, b, c, d \leq 12).

Output

For each test case, output "YES" (without quotes) if the strings intersect, and "NO" (without quotes) otherwise.

You can output "YES" and "NO" in any case (for example, strings "yEs", "yes", and "Yes" will be recognized as a positive response).

输入数据 1

15
2 9 10 6
3 8 9 1
1 2 3 4
5 3 4 12
1 8 2 10
3 12 11 8
9 10 12 1
12 1 10 2
3 12 6 9
1 9 8 4
6 7 9 12
7 12 9 6
10 12 11 1
3 9 6 12
1 4 3 5

输出数据 1

YES
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
YES
YES
YES
YES

Note

The first test case is pictured in the statement.

In the second test case, the strings do not intersect, as shown below.