import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

from math import log

def nCr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]-fac[com_r]-fac[com_n-com_r]

# 準備
n_max = 100005
fac = [0]
for i in range(1, n_max+1): fac.append(fac[-1]+log(i))

def solve():
    n, m, k = LI()
    f = nCr(n, k)+log(m)
    s = log(n)+k*log(m)
    if n == k: s = k*log(m)
    if f < s: print("Flush")
    else: print("Straight")

for _ in range(II()):
    solve()