#include<iostream>
#include<vector>
#include<tuple>
using namespace std;
typedef long long ll;
typedef tuple<ll,ll,ll> tlll;
//能交换任意两个相邻肯定就能实现全部序列，要实现全部序列也得能交换任意两个相邻
//最难的就是最中间的两个互换，因为两边空间更大
//扩展欧几里得算法
tlll check(ll a,ll b){
    if(a<b) swap(a,b);
    ll q=a/b;ll r=a-q*b;
    if(r==0) return make_tuple(b,1,q-1);
    auto sub=check(b,r);
    return make_tuple(get<0>(sub),get<2>(sub),get<1>(sub)-get<2>(sub)*q);
}
int main(){
    int t;
    cin>>t;
    for(int i=0;i<t;i++){
        ll n,a,b;
        cin>>n>>a>>b;
        if(a==1||b==1) {cout<<"YES"<<endl;continue;}
        if(a<b) swap(a,b);
        auto rst=check(a,b);
        if(get<0>(rst)!=1) {cout<<"NO"<<endl;continue;}
        //中间最多往前走N/2
        if(get<1>(rst)>0&&get<1>(rst)*a>n/2) {cout<<"NO"<<endl;continue;}
        if(get<2>(rst)>0&&get<2>(rst)*b>n/2) {cout<<"NO"<<endl;continue;}
        cout<<"YES"<<endl;
    }

    return 0;
}