#include <bits/stdc++.h>
#define rep(a,n) for (int a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
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; }
const ll INF = 1e18;


int main(){
    vector<double>lg(2e5,0.0);
    for(int i=1;i<1e5+5;i++){
        lg[i]=lg[i-1]+log(i);
    }
    ll q;
    cin >> q;
    rep(i,q){
        double n,m,k;
        cin >> n >> m >> k;
        double F,S;
        F = log(m)+lg[n]-lg[k]-lg[n-k];
        S = k*log(m)+log(n-k+1);
        if(F>S){
            cout << "Straight" << endl;
        }
        else{
            cout << "Flush" << endl;
        }
    }
    return 0;
}