#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const int L=1e5;
typedef long double ld;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  vector<ld> val(L+1,0);
  for(int i=1;i<=L;i++) val[i]=log(i);
  vector<ld> sum(L+1,0);
  for(int i=1;i<=L;i++) sum[i]=sum[i-1]+val[i];

  int Q;
  cin>>Q;
  rep(q,Q){
    int N,M,K;
    cin>>N>>M>>K;

    ld F=val[M]+sum[N]-sum[N-K]-sum[K];
    ld S=val[N-K+1]+K*val[M];

    if(F<S) cout<<"Flush"<<"\n";
    else cout<<"Straight"<<"\n";
  }

  return 0;
}