#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int Q; cin >> Q;
    const int MAXN = 100010;
    vector<long double> fact(MAXN,0);
    rep(i,MAXN - 1) fact[i + 1] = fact[i] + log((long double)i + 1);

    rep(i,Q) {
        int N,M,K; cin >> N >> M >> K;
        long double fs = fact[N] - fact[N - K + 1] - (K - 1) * log((long double)M) - fact[K];
        if (fs < (long double)0.0) cout << "Flush" << '\n';
        else cout << "Straight" << '\n';
    }
    return 0;
}