import sys
input=lambda:sys.stdin.readline().rstrip()
def solve():
X=sorted(list(map(int,input().split())))
print(['NO','YES'][X[2]<=X[0]+X[1]+1])
T=int(input())
for i in range(T):
solve()#include <iostream>
#include <math.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, b, c;
cin >> a >> b >> c;
long long maxVal = max(max(a, b), c);
if (a + b + c - maxVal + 1 >= maxVal) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
return 0;
}1374C - Move Brackets | 1476A - K-divisible Sum |
1333A - Little Artem | 432D - Prefixes and Suffixes |
486A - Calculating Function | 1373B - 01 Game |
1187A - Stickers and Toys | 313B - Ilya and Queries |
579A - Raising Bacteria | 723A - The New Year Meeting Friends |
302A - Eugeny and Array | 1638B - Odd Swap Sort |
1370C - Number Game | 1206B - Make Product Equal One |
131A - cAPS lOCK | 1635A - Min Or Sum |
474A - Keyboard | 1343A - Candies |
1343C - Alternating Subsequence | 1325A - EhAb AnD gCd |
746A - Compote | 318A - Even Odds |
550B - Preparing Olympiad | 939B - Hamster Farm |
732A - Buy a Shovel | 1220C - Substring Game in the Lesson |
452A - Eevee | 1647B - Madoka and the Elegant Gift |
1408A - Circle Coloring | 766B - Mahmoud and a Triangle |