A. Food for Animals

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In the pet store on sale there are:

• aa packs of dog food;
• bb packs of cat food;
• cc packs of universal food (such food is suitable for both dogs and cats).

Polycarp has xx dogs and yy cats. Is it possible that he will be able to buy food for all his animals in the store? Each of his dogs and each of his cats should receive one pack of suitable food for it.

Input

The first line of input contains an integer tt (1≤t≤1041≤t≤104) — the number of test cases in the input.

Then tt lines are given, each containing a description of one test case. Each description consists of five integers a,b,c,xa,b,c,x and yy (0≤a,b,c,x,y≤1080≤a,b,c,x,y≤108).

Output

For each test case in a separate line, output:

• YES, if suitable food can be bought for each of xx dogs and for each of yy cats;
• NO else.

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

Example

input

Copy

7
1 1 4 2 3
0 0 0 0 0
5 5 0 4 6
1 1 1 1 1
50000000 50000000 100000000 100000000 100000000
0 0 0 100000000 100000000
1 3 2 2 5

output

Copy

YES
YES
NO
YES
YES
NO
NO

解题说明：水题，先用ab去计算，不够的再用c去补。

#include<stdio.h>
int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int a, b, c, x, y, cnt = 0;
		scanf("%d%d%d%d%d", &a, &b, &c, &x, &y);
		if (a < x)
		{
			cnt += x - a;
		}
		if (b < y)
		{
			cnt += y - b;
		}
		if (c >= cnt)
		{
			printf("Yes\n");
		}
		else
		{
			printf("No\n");
		}
	}
	return 0;
}