#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

const int FACT_MAX = 200005;
double fact[FACT_MAX], fact_inv[FACT_MAX];

void make_fact()
{
	double val = 0;
	fact[0] = 0;
	for(int i = 1; i < FACT_MAX; i++){
		val += log(i);
		fact[i] = val;
	}
}

double comb(llint n, llint k)
{
	double ret = 0;
	ret += fact[n];
	ret -= fact[k];
	ret -= fact[n-k];
	return ret;
}

llint Q;
llint n, m, k;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	make_fact();
		
	cin >> Q;
	for(int q = 0; q < Q; q++){
		cin >> n >> m >> k;
		if(log(m)+comb(n, k) < log(n-k+1)+k*log(m)) cout << "Flush" << endl;
		else cout << "Straight" << endl;
	}
	
	return 0;
}