#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int MAX = 1e5+1;

int main(){
  int q;
  cin >> q;
  vector<double> sum(MAX);
  for(int i = 1; i < MAX; i++) sum[i] = sum[i-1] + log((double)i);
  while(q--) {
    int n, m, k;
    cin >> n >> m >> k;
    if(sum[n] - sum[k] - sum[n-k+1] - log(m)*(k-1) > 0) cout << "Flush" << endl;
    else cout << "Straight" << endl;
  }
  return 0;
}