import sys import math import collections import bisect import itertools import decimal import copy from math import log2 # import numpy as np # sys.setrecursionlimit(10 ** 6) INF = 10 ** 20 # MOD = 10 ** 9 + 7 # MOD = 998244353 ni = lambda: int(sys.stdin.readline().rstrip()) ns = lambda: map(int, sys.stdin.readline().rstrip().split()) na = lambda: list(map(int, sys.stdin.readline().rstrip().split())) na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())) # ===CODE=== def main(): logfact = [0] tei = 0.99 for i in range(1, 10 ** 5 + 1): logfact.append(logfact[-1] + math.log(i, tei)) q = ni() for _ in range(q): n, m, k = ns() f = math.log(m, tei) + logfact[n] - logfact[n - k] - logfact[k] s = k * math.log(m, tei) + math.log(n - k + 1, tei) print("Straight" if s > f else "Flush") if __name__ == '__main__': main()