#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<queue>
#include<utility>
#include<list>
#include<set>
#include<functional>
#include<assert.h>

using namespace std;
using ll = long long;
using ld = long double;

const int N = (int)2e5 + 5;

using namespace std;

ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }


void solve() {
  int n, e, k;
  cin >> n >> e >> k;
  if (e == 0 || k >= n || e >= n)
    return void(cout << "Yes");

  int stay = k - e;
  if (stay < 0)stay = 0;
  
  int to = n - stay;
  int skipped = min(e, k) - 1;
  int dis = (to - skipped);
  
  if (dis-1 <= e)
    cout << "Yes";
  else 
    cout << "No";
}


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  int _ = 1;
  cin >> _;

  while (_--) {
    solve();
    cout << '\n';
  }
}