#include #define endl "\n" using namespace std; #define ll long long #define ld long double #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define repo(i,n) for(int i = 1; i < (int)(n); i++) #define pb push_back #define mp make_pair #define np next_permutation #define fi first #define se second #define all(x) (x).begin(),(x).end() #define uniq(v) v.erase(unique(v.begin(),v.end()),v.end()) #define lb(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin()) #define ub(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin()) using Pair = pair>; #define pq priority_queue, greater> const ll mod=1000000007; //const ll mod=998244353; const ld pi=acos(-1.0); const ll INF = 1LL<<61; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b>qq; vector p(101010); repo(i,101010){ p[i]=log(i); } for(int i=2;i<=100100;i++){ p[i]+=p[i-1]; } rep(qqq,qq){ ll n,m,k; cin>>n>>m>>k; if(p[n]-p[k]-p[n-k]-log(n-k+1)-(ld)(k-1)*log(m)>0) { cout << "Straight" << endl; } else cout << "Flush" << endl; } }