#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
double f[100010];
int main()
{
    int q; cin>>q;
    for(int i=1; i<=100000; i++) f[i]=f[i-1]+log((double)i);
    while(q--){
        int n, m, k; cin>>n>>m>>k;
        double x=log((double)m)+f[n]-f[n-k]-f[k]-k*log((double)m)-log((double)(n-k+1));
        if(x>0) cout<<"Straight"<<endl;
        else cout<<"Flush"<<endl;
    }
    return 0;
}