#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;


class Factorial {
    vector<double> facts, factinv;
public:
    explicit Factorial(int n) : facts(n+1), factinv(n+1) {
        facts[0] = 0;
        for (int i = 1; i < n+1; ++i) facts[i] = facts[i-1] + log(i);
        for (int i = n; i >= 0; --i) factinv[i] = -facts[i];
    }
    double C(int p, int q) const {
        if(q < 0 || p < q) return -1e10;
        return facts[p] + factinv[q] + factinv[p-q];
    }
};
int main() {
    Factorial f(100001);
    int q;
    cin >> q;
    while(q--){
        int n, m, k;
        cin >> n >> m >> k;
        if(log(m) + f.C(n, k) < k*log(m) + log(n-k+1)) puts("Flush");
        else puts("Straight");
    }
    return 0;
}