#include <bits/stdc++.h>
using namespace std;
const long double epsilon = 10e-6;
const int MAX_N = 1e5;
const long long int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const long long int LINF = 1e18;
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) {
      res = res * x;
    }
    y = y >> 1;
    x = x * x;
  }
  return res;
}
long long int gcd(long long int x, long long int y) {
  if (y == 0) {
    return x;
  }
  return gcd(y, x % y);
}
int solve() {
  long long int a[3], m;
  cin >> a[0] >> a[1] >> a[2] >> m;
  long long int maxi = 0, mini;
  for (long long int i = 0; i < 3; i++) {
    if (a[i] > 0) {
      maxi += a[i] - 1;
    }
  }
  sort(a, a + 3);
  if (a[2] - 1 <= a[0] + a[1]) {
    mini = 0;
  } else {
    mini = a[2] - 1 - a[0] - a[1];
  }
  if (m <= maxi && m >= mini) {
    cout << "YES\n";
    return 0;
  }
  cout << "NO\n";
  return 0;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  t = 1;
  cin >> t;
  for (int i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
