#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

void solve(ll N,ll P,ll K){
    if(N<=4){
        if(K==0) cout<<"Yes\n";
        else cout<<"No\n";
        return;
    }else{
        if(P==1){
            if(0<=K&&K<=N/5) cout<<"Yes\n";
            else cout<<"No\n";
            return;
        }else{
            if(K%P==0){
                if(0<=K/P&&K/P<=N/5){
                    cout<<"Yes\n";
                    return;
                }
            }
            if(K%P==P-1){
                if(0<=K/P+1&&K/P+1<=N/5){
                    cout<<"Yes\n";
                    return;
                }
            }
        }
    }
    cout<<"No\n";
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,P,K;cin>>N>>P>>K;
        solve(N,P,K);
        
    }
}