#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll N, M, K;
double f[100001]{};

void solve() {
    double F = log(M) + f[N] - f[K] - f[N - K];
    double S = log(M) * K + log(N - K + 1);
    if (F < S) {
        cout << "Flush\n";
    } else {
        cout << "Straight\n";
    }
}

int main() {
    int Q;
    cin >> Q;
    for (int i = 0; i < 100000; i++) {
        f[i + 1] = f[i] + log(i + 1);
    }
    
    for (int i = 0; i < Q; i++) {
        cin >> N >> M >> K;
        solve();
    }

    return 0;
}