#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int bin(long int a[], long int low, long int high, long d, long day[]) {
  if (low > high) return -1;
  long mid = (low + high) / 2;
  if (a[mid] > (a[low] + d) && (a[mid - 1] <= (a[low] + d) || day[mid - 1]) &&
      day[mid] == 0)
    return mid;
  else if (a[mid] > (a[low] + d) && day[mid] == 0)
    return bin(a, low, mid - 1, d, day);
  else
    return bin(a, mid + 1, high, d - a[mid + 1] + a[low], day);
}
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2 == 0) return (power((a * a), b / 2));
  return ((a) * (power((a * a), b / 2)));
}
bool cmp(int a, int b) { return a > b; }
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first > b.first;
}
int main() {
  int t = 1;
  cin >> t;
  for (int X = 1; X <= t; X++) {
    int r, g, b, m, sum;
    cin >> r >> g >> b;
    sum = r + g + b;
    m = max(r, max(g, b));
    sum -= m;
    if (m <= sum + 1)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return 0;
}
