#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);

int main() {
    cin>>Q;
    const int max_n = (int)1e+5 + 10;
    vector<long double> sum(max_n, 0);
    reps(i, 1, max_n) sum[i] = sum[i - 1] + log(i);
    rep(_, Q){
        cin>>N>>M>>K;
        cout<<(sum[N] - sum[N - K + 1] - sum[K] - log(M) * (K - 1) < 0 ? "Flush" : "Straight")<<endl;
    }
}