#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>

using namespace std;
typedef long long ll;

double fac_log[200005];

double comb_log(int n, int m){
    return fac_log[n]-fac_log[n-m]-fac_log[m];
}

void init(){
    fac_log[0] = 0;
    fac_log[1] = 0;
    for(int i = 2; i <= 200000; i++){
        fac_log[i] = fac_log[i-1]+log((double)i);
    }
}

void solve(){
    int N, M, K; cin >> N >> M >> K;
    double f = log((double)M)+comb_log(N, K);
    double s = K*log((double)M)+log((double)(N-K+1));
    if(f < s) cout << "Flush" << endl;
    else cout << "Straight" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int Q; cin >> Q;
    for(int i = 0; i < Q; i++) solve();
}