The final match of the World Cup will be played between Jordan and Argentina.
The tickets are already sold. Jordan will have $$$A$$$ supporters, and Argentina will have $$$B$$$ supporters.
Now, all supporters need to go to the stadium. There are two types of vehicles available:
However, supporters of different teams cannot be placed in the same vehicle, because this will cause a problem.
You are given $$$A$$$, $$$B$$$, $$$x$$$, and $$$y$$$, where $$$x$$$ is the number of available buses and $$$y$$$ is the number of available taxis.
Determine whether it is possible to transport all supporters to the stadium without putting supporters of different teams in the same vehicle.
A vehicle does not have to be full. It is allowed for a vehicle to carry only one supporter.
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.
The first and only line of each test case contains four integers $$$A$$$, $$$B$$$, $$$x$$$, and $$$y$$$ ($$$1 \le A, B \le 10^9$$$, $$$0 \le x, y \le 10^9$$$) — the number of Jordan supporters, the number of Argentina supporters, the number of available buses, and the number of available taxis, respectively.
For each test case, print YES if it is possible to transport all supporters to the stadium without causing problems.
Otherwise, print NO.
You can print each letter in any case. For example, YES, Yes, and yes will all be accepted.
625 4 1 126 4 1 130 20 2 350 50 3 01 1 0 1100 1 4 1
YESNOYESNONOYES
In the first test case, we can put the $$$25$$$ Jordan supporters in the bus, and the $$$4$$$ Argentina supporters in the taxi.
In the second test case, the $$$26$$$ Jordan supporters need both the bus and the taxi, so there will be no vehicle left for the Argentina supporters.
In the fifth test case, there is only one taxi. Although it has enough capacity for two people, it cannot carry supporters from both teams.