#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

long double fact[100001];

long double mypow(long double x, long long n) {
    long double ret = 1;
    while (n > 0) {
        if (n & 1) ret = (ret * x) ;  
        x = (x * x) ;
        n >>= 1;  
    }
    return ret;
}


int main(){
    fact[0] = 1;
    for(int i=1;i<100001;i++) fact[i] = fact[i-1] * (double)i;

    int q;
    cin >> q;
    while(q--){
        int n,m,k;
        cin >> n >> m >> k;
        long double com = (fact[n] / fact[k]) / fact[n-k];
        long double p = (n-k+1) * mypow(m,k-1);
        if(com < p) cout << "Flush" << endl;
        else cout << "Straight" << endl;
    }

    return 0;
}