#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double eps = 1e-9;

void solve() {
    ll N, M, K;
    cin >> N >> M >> K;

    double ans = (double)(N - K + 1) / (double)(M);
    // cerr << "ans=" << ans << endl;
    rep(i, K) {
        ans = ans * (double)(M * (i + 1)) / (double)(N - i);
        // cerr << "i=" << i << "ans=" << ans << endl;
        if (ans < eps || ans > (1 / eps)) {
            break;
        }
    }
    // cerr << "ans = " << ans << endl;
    if (ans > 1.5) {
        cout << "Flush"
             << "\n";

    } else {
        cout << "Straight"
             << "\n";
    }
}

int main() {
    ll Q;
    cin >> Q;
    rep(i, Q) {
        solve();
    }

    return 0;
}