Read problems statements in [Mandarin Chinese], [Russian], [Vietnamese] and [Bengali] as well.

Ash is trying to get visa to Chefland. For the visa to be approved, he needs to satisfy the following three criteria:
Solve at least $x_{1}$ problems on Codechef.
Have at least $y_{1}$ current rating on Codechef.
Make his last submission at most $z_{1}$ months ago.

You are given the number of problems solved by Chef ($x_{2}$), his current rating ($y_{2}$) and the information that he made his last submission $z_{2}$ months ago. Determine whether he will get the visa.

------ Input ------
The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
The first and only line of each test case contains six space-separated integers $x_{1}$, $x_{2}$, $y_{1}$, $y_{2}$, $z_{1}$ and $z_{2}$.

------ Output ------
For each test case, print a single line containing the string "YES" if Chef will get the visa or "NO" if he will not.

You may print each character of the string in uppercase or lowercase (for example, the strings "yEs", "yes", "Yes" and "YES" will all be treated as identical).

------ Constraints ------
$1 ≤ T ≤ 5,000$
$20 ≤ x_{1}, x_{2} ≤ 50$
$1,900 ≤ y_{1}, y_{2} ≤ 2,100$
$1 ≤ z_{1}, z_{2} ≤ 6$

----- Sample Input 1 ------
4
20 50 2100 1900 6 6
50 20 1900 1900 5 5
20 20 1900 1900 1 6
27 27 1920 1920 3 3
----- Sample Output 1 ------
NO
NO
NO
YES
----- explanation 1 ------
Example case 1: Chef's rating is less than the minimum required rating.

Example case 2: Chef has solved a smaller number of problems than the minimum required number.

Example case 3: Chef's last submission was made before the allowed period.

Example case 4: All three conditions are met.

见题面

见题面