import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 2 * 10^^5 + 10;

void main() {
  auto logFac = new real[LIM];
  logFac[0] = 0.0L;
  foreach (i; 1 .. LIM) {
    logFac[i] = logFac[i - 1] + log(cast(real)(i));
  }
  
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const N = readInt();
        const M = readInt();
        const K = readInt();
        
        /*
          M binom(N, K)
          (N - K + 1) M^K
        */
        const f = log(cast(real)(M)) + (logFac[N] - logFac[K] - logFac[N - K]);
        const s = log(cast(real)(N - K + 1)) + K * log(cast(real)(M));
        debug {
          writeln(exp(f), " ", exp(s));
        }
        writeln((f < s) ? "Flush" : "Straight");
      }
    }
  } catch (EOFException e) {
  }
}