#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

bool solve(ll n, ll a, ll b){
    if(a == 1) return true;
    if(gcd(a, b) != 1) return false;
    // if((n)/2 < b) return false;
    if((n+1)/2 >= b) return true;
    if((n)/2 < a) return false;
    if(n-b >= a) return true;
    ll rl = n-b-1;
    ll lr = b%a, rr = (n-1)%a;
    if(lr < rr){
        return (rl >= lr) && (rr == a-1);
    }
    return rl >= lr;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) {
        ll n, a, b; cin >> n >> a >> b;
        if(a > b) swap(a, b);
        if(solve(n, a, b)) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
}