#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

double A[100010];

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