#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 100005;
int prime[1100000], primesize;
bool isprime[11000000];
long long f[N], invf[N];
char tmp[2000050];
int len[2000050];
int s1, s2;
void Manacher(string s) {
  tmp[0] = '$';
  tmp[1] = '#';
  int t = s.size();
  for (int i = 0; i < 2 * t + 5; i++) len[i] = 0;
  for (int i = 1; i <= t; i++) {
    tmp[2 * i] = s[i - 1];
    tmp[2 * i + 1] = '#';
  }
  tmp[2 * t + 2] = '\0';
  int mx = 0;
  int mid;
  for (int i = 1; tmp[i]; i++) {
    if (i < mx)
      len[i] = min(len[2 * mid - i], mx - i);
    else
      len[i] = 1;
    while (tmp[i - len[i]] == tmp[i + len[i]]) len[i]++;
    if (len[i] + i > mx) {
      mx = len[i] + i;
      mid = i;
    }
    int l = len[i] - 1;
    if (i % 2 == 0) {
      l = (l - 1) / 2;
      int p = i / 2;
      if (p - l == 1) s1 = max(s1, len[i] - 1);
      if (p + l == t) s2 = max(s2, len[i] - 1);
    } else {
      l = l / 2;
      int p = (i - 1) / 2, q = (i + 1) / 2;
      if (p - l + 1 == 1) s1 = max(s1, len[i] - 1);
      if (q + l - 1 == t) s2 = max(s2, len[i] - 1);
    }
  }
}
void getlist(int listsize) {
  memset(isprime, 1, sizeof(isprime));
  isprime[1] = false;
  for (int i = 2; i <= listsize; i++) {
    if (isprime[i]) prime[++primesize] = i;
    for (int j = 1; j <= primesize && i * prime[j] <= listsize; j++) {
      isprime[i * prime[j]] = false;
      if (i % prime[j] == 0) break;
    }
  }
}
long long fpow(long long a, long long k) {
  long long res = 1;
  while (k) {
    if (k & 1) res = (res * a) % mod;
    k >>= 1;
    a = a * a % mod;
  }
  return res;
}
void init(int n) {
  f[0] = 1;
  for (int i = 1; i <= n; ++i) {
    f[i] = f[i - 1] * i % mod;
  }
  invf[n] = fpow(f[n], mod - 2);
  for (int i = n - 1; i >= 0; --i) {
    invf[i] = invf[i + 1] * (i + 1) % mod;
  }
}
long long C(int n, int k) {
  if (k < 0 || k > n) return 0;
  return f[n] * invf[k] % mod * invf[n - k] % mod;
}
int a[15];
void solve() {
  cin >> a[1] >> a[2] >> a[3];
  sort(a + 1, a + 4);
  if (a[3] > a[2] + a[1] + 1) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
