#include <bits/stdc++.h>

const int N = 100010;

double fac[N];

int main(){
    for (int i = 1; i < N; ++ i){
        fac[i] = fac[i - 1] + std::log(i);
    }
    int test;
    scanf("%d", &test);
    while (test --){
        int n, m, k;
        scanf("%d%d%d", &n, &m, &k);
        double prob1 = fac[n] - fac[k] - fac[n - k] + std::log(m);
        double prob2 = std::log(n - k + 1) + k * std::log(m);
        puts(prob1 < prob2 ? "Flush" : "Straight");
    }
    return 0;
}