A. Dice Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob are playing a game with two special dices.For a throw,Alice'll get an integer number in $$$[l_1, r_1]$$$,and Bob'll get an integer number in $$$[l_2, r_2]$$$.The probability of each number appearing is equal.

They will throw their dice twice and sum up two numbers they will get.If their sums are equal,they tie.Otherwise the person with a larger sum will win the game.

You task is to determine if the probability of Alice's winning is strictly higher than Bob's .

Input

The first line of the test case contains an integer $$$t$$$ ($$$1 \le t \le 10^5$$$), which denotes the number of test cases.

The first line of each test case contains two integers $$$l_1$$$ and $$$r_1$$$ ($$$1 \le l_1 \lt r_1 \le 10^9$$$), which describes the dice of Alice.

The second line of each test case contains two integers $$$l_2$$$ and $$$r_2$$$ ($$$1 \le l_2 \lt r_2 \le 10^9$$$), which describes the dice of Bob.

Output

For each test case, output "Yes" (without quotes) if the probability of Alice's winning is strictly higher than Bob's, and "No" (without quotes) otherwise.

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
2
1 2
2 3
8 9
6 8
Output
NO
YES
Note

In sample case $$$1$$$, there are total $$$9$$$ possible final results as given below:

$$$[2, 4],$$$ $$$[2, 5],$$$ $$$[2, 6],$$$ $$$[3, 4],$$$ $$$[3, 5],$$$ $$$[3, 6],$$$ $$$[4, 4],$$$ $$$[4, 5],$$$ $$$[4, 6]$$$

Among these, Alice can not win any games, So the probability that Alice will win is $$$0$$$. Thus, the answer is "NO".