import math
tc=1
tc = int(input())
for i in range(tc):
a,b,c,x,y = map(int,input().split())
a = min(0,a-x)
b = min(0,b-y)
if -(a+b)<=c:
print('YES')
else:
print('NO')
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
int t;
cin >> t;
while (t--) {
int a, b, c, x, y;
cin >> a >> b >> c >> x >> y;
int tmp = 0;
if (x >= a) tmp += (x - a);
if (y >= b) tmp += (y - b);
if (c >= tmp) cout << "YES" << endl;
else cout << "NO" << endl;
}
}
1671C - Dolce Vita | 1669G - Fall Down |
4D - Mysterious Present | 1316B - String Modification |
1204A - BowWow and the Timetable | 508B - Anton and currency you all know |
1672A - Log Chopping | 300A - Array |
48D - Permutations | 677C - Vanya and Label |
1583B - Omkar and Heavenly Tree | 1703C - Cypher |
1511C - Yet Another Card Deck | 1698A - XOR Mixup |
1702E - Split Into Two Sets | 1703B - ICPC Balloons |
1702F - Equate Multisets | 1700A - Optimal Path |
665C - Simple Strings | 1708A - Difference Operations |
1703E - Mirror Grid | 1042A - Benches |
1676B - Equal Candies | 1705B - Mark the Dust Sweeper |
1711A - Perfect Permutation | 1701B - Permutation |
1692A - Marathon | 1066A - Vova and Train |
169B - Replacing Digits | 171D - Broken checker |