#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>


using namespace std;
typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

long double sum[200000];
void solve() {
	ll n, m, k; cin >> n >> m >> k;
	long double f = -1e18;
	if(n >= k) f = log(m) + sum[n] - sum[n - k] - sum[k];
	long double s = -1e18;
	if (n - k + 1 > 0) {
		s = log(n - k + 1) + k * log(m);
	}
	//cout << f << " " << s << endl;
	if (f < s) cout << "Flush" << "\n";
	else cout << "Straight" << "\n";
}
int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	sum[0] = 0; for (int i = 1; i < 200000; i++) sum[i + 1] = sum[i] + log(i);
	sum[0] = 1;
	int kkt; cin >> kkt;
	while (kkt--) solve();
	return 0;
}