#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)

vector<double>d(100010);

void solve(){
	int N, M, K;
	cin >> N >> M >> K;
	long double f = log(M) + d[N] - d[K] - d[N - K];
	f -= log(N - K + 1) + K * log(M);
	if(f < 0) out("Flush");
	else out("Straight");
}

signed main(){
	IOS();
	REP(i, d.size() - 1) d[i + 1] = d[i] + log(i + 1);
	int Q = 1;
	cin >> Q;
	while(Q--)solve();
}