#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;



int main(){
    int q; cin >> q;
    vector<double> l(100000);
    rep(i,100000){
        l[i] = log(i+1);
    }
    vector<double> sum(100001);
    rep(i,100000){
        sum[i+1] = sum[i]+l[i];
    }
    while(q--){
        int n,m,k; cin >> n >> m >> k;
        double left = sum[n]-sum[n-k+1];
        double right = sum[k]+log(m)*(k-1);
        if(left < right) cout << "Flush" << endl;
        else cout << "Straight" << endl;
    }
}