#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
double fac[100010];
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    for(int i=2;i<=100000;i++){
        fac[i] = fac[i-1] + log(i);
    }
    int q;
    cin >> q;
    rep(zz,q){
        int n,m,k;
        cin >> n >> m >> k;
        double S = (double)(k)*log(m) + log(n-k+1);
        double F = log(m) + fac[n] -fac[k] - fac[n-k];
        // cerr << F << " " << S << endl;
        if(F>S){
            cout << "Straight\n"; 
        }else{
            cout << "Flush\n";
        }
    }
    return 0;
}