#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Staright");}else{puts("Flush");}
#define MAX_N 200005

double sum[MAX_N];

int main() {
    srep(i,1,MAX_N){
        sum[i] = sum[i-1] + log(i);
    }

    int Q;
    cin >> Q;
    rep(_,Q){
        ll n, m, k;
        cin >> n >> m >> k;
        double st = log(m) * (k-1);
        double fl = sum[n] - (sum[k] + sum[n-k+1]);
        if(st < fl)yn;
    }

    return 0;
}