t = int(input())
for _ in range(t):
n,a,b = map(int,input().split())
if a+b<=n-2 or (a==b and a==n):
print("Yes")
else:
print("No")#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll sol()
{
ll n,a,b;
cin>>n>>a>>b;
if(a==b && n==b)
{
cout<<"Yes"<<endl;
return 0;
}
else
{
if(n-a-b>1)
{
cout<<"Yes"<<endl;
return 0;
}
else{
cout<<"No"<<endl;
return 0;
}
}
return 0;
}
int main()
{
ll t;
cin>>t;
while(t--)
{
ll a=sol();
}
}
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |