#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int N = 2e5 + 5;
int gcd(int a, int b) {
  if (b == 0) return a;
  a %= b;
  return gcd(b, a);
}
bool compare(long long i, long long j) { return i > j; }
long long power(long long x, long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return (power(x, y / 2) % mod * power(x, y / 2) % mod) % mod;
  else
    return (x % mod * power(x, y / 2) % mod * power(x, y / 2) % mod) % mod;
}
class sortByVal {
 public:
  bool operator()(const pair<long long, pair<long long, long long>> &a,
                  const pair<long long, pair<long long, long long>> &b) {
    if (a.first != b.first) {
      return a.first < b.first;
    }
    return a.second.first > b.second.first;
  }
};
bool prime[100005];
void SieveOfEratosthenes(long long n) {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    long long a, b, n, m;
    cin >> a >> b >> n >> m;
    if (n + m > a + b) {
      cout << "NO" << endl;
      ;
    } else {
      if (m > min(a, b)) {
        cout << "NO" << endl;
        ;
      } else
        cout << "YES" << endl;
      ;
    }
  }
}
