#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll primeTop = 33000;

ll power(ll a, ll b){
    if (b == 0)
        return 1;
    else if (b == 1)
        return a;
    if (b % 2)
        return a * power(a*a, b/2);
    else
        return power(a*a, b/2);
}

ll pcount;
vector<ll> primes;
void precomputePrimes(){
    primes = vector<ll>();
    vector<bool> isprime(primeTop, true);
    for (ll i = 2; i < primeTop; i++){
        if(isprime[i]){
            primes.push_back(i);
            for (ll c = i*i; c < primeTop; c += i)
                isprime[c] = false;
        }
    }
    pcount = primes.size();
}

ll n, m, k;
vector<ll> kfactors;
void factorK(){
    ll r = k;
    kfactors = vector<ll> (pcount, 0);
    for(ll i = 0; i < pcount; i++){
        while(r % primes[i] == 0){
            r /= primes[i];
            kfactors[i]++;
        }
        //if(kfactors[i] > 0)
            //cerr << primes[i] << " ^ " << kfactors[i] << endl;
    }
}

ll num;

bool check(){
    //cerr << "check " << num << endl;
    return (num <= min(n, m) && k/num <= max(n, m));
}

bool iter(ll x){
    if(x == pcount - 1){
        if(check())
            return true;
    }
    else if (iter(x+1))
        return true;
    for(ll i = 1; i <= kfactors[x]; i++){
        //cerr << "num = " << num << endl;
        //cerr << "kfactors of " << primes[x] << " = " << kfactors[x] << endl;
        num *= primes[x];
        //cerr << "pcount = " << pcount << endl;
        if(x == pcount - 1){
            if(check())
                return true;
        }
        else if (iter(x+1))
            return true;
    }
    num /= power(primes[x], kfactors[x]);
    return false;
}

int main() {
    precomputePrimes();
    int t;
    cin >> t;
    cin >> n >> m >> k;
    while(t--){
        //cerr << endl << "k = " << k << endl;
        if (t == 1)
            cerr << "yes" << endl;
        factorK();
        if (t == 1)
            cerr << "factored" << endl;
        //cerr << "factored" << endl;
        num = 1;
        if (iter(0))
            cout << "SI" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}

input:
16028
64 64 1000