#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;

double fact(int n) {
    static vector<double> memo(1, 1);
    while (n >= memo.size()) {
        int i = memo.size();
        memo.push_back(memo.back() * i);
    }
    return memo[n];
}

bool solve(int64_t n, int64_t m, int64_t k) {
    double f = m * fact(n) * fact(n - k) / fact(k);
    double s = (n - k + 1) * pow(m, k);
    return f < s;
}

// generated by online-judge-template-generator v4.6.0 (https://github.com/online-judge-tools/template-generator)
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    constexpr char endl = '\n';
    int Q;
    cin >> Q;
    REP (i, Q) {
        int64_t N, M, K;
        cin >> N >> M >> K;
        auto ans = solve(N, M, K);
        cout << (ans ? "Flush" : "Straight") << endl;
    }
    return 0;
}