#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    constexpr int MAX = 100000;
    vector<double> logsum(MAX + 1);
    for(int i = 1; i <= MAX; ++i){
        logsum[i] = logsum[i - 1] + log(i);
    }

    int Q;
    cin >> Q;
    for(int q = 0; q < Q; ++q){
        int N, M, K;
        cin >> N >> M >> K;
        if(logsum[N - K + 1] + logsum[K] + log(M) * (K - 1) - logsum[N] > 0){
            cout << "Flush\n";
        }
        else    cout << "Straight\n";
    }

    return 0;
}