#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/modint>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using mll = atcoder::static_modint<998244353>;
#define rep(i,n) for(int i=0; i<(n); i++)

ull GCD(ull a,ull b){ return b ? a : GCD(b,a%b); }

void testcase(){
  ull N,A,B; cin >> N >> A >> B;
  if(GCD(A,B) != 1){ cout << "NO\n"; return; }
  if(A+B-1 > N){ cout << "NO\n"; return; }
  cout << "YES\n";
}

int main(){
  int T; cin >> T;
  while(T--) testcase();
  return 0;
}


struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;