For consecutive days, amateur meteorologist Ostap recorded in his diary what each day was like: sunny or rainy.
Ostap's younger brother spilled tea on the diary, and the daily entries became illegible. Only a page with a summary at the end survived. For each pair of adjacent days (day and day i+1, where 1 \le i < n), Ostap counted what type it was:
pairs in which a sunny day is followed by a sunny day;
pairs in which a rainy day is followed by a rainy day;
pairs in which a sunny day is followed by a rainy day;
pairs in which a rainy day is followed by a sunny day.
Each of the n-1 pairs is counted exactly once, so e + g + u + v = n - 1.
Ostap is not sure that he didn't make a mistake in his counting. Determine whether there exists at least one sequence of weather for days that agrees with all four numbers of the summary.
The diary contains summaries for several different periods, so this question needs to be answered for independent summaries.
The first line contains an integer (1 \le t \le 10^5) — the number of summaries.
Each of the next lines describes one summary and contains five integers , , , , (1 \le n \le 2 \cdot 10^5; e, g, u, v \ge 0; e + g + u + v = n - 1).
The sum of over all summaries does not exceed 4 \cdot 10^6.
For each summary, output a separate line: YES if there exists a weather sequence matching it, or NO otherwise.
The case of letters does not matter: yes, Yes, and YES are all accepted equally.
Example 1
Let us denote a sunny day by the letter S, and a rainy day by the letter R.
In the first summary of the example, the sequence SSRRS fits: its pairs are SS, SR, RR, and RS.
In the second summary, the sequence SSRSR fits: its pairs are SS, SR, RS, and SR.
In the third summary, all four pairs would have to be “sunny, then rainy”. Then the second day would have to be rainy (as the second day of the first pair) and sunny (as the first day of the second pair) at the same time, which is impossible.
In the fourth summary, the sequence SRS fits.