#include #ifdef DEBUG #include #else #define dump(...) ((void)0) #endif template bool chmin(T &a, const U &b){ return (a > b ? a = b, true : false); } template bool chmax(T &a, const U &b){ return (a < b ? a = b, true : false); } template void fill_array(T (&a)[N], const U &v){ std::fill((U*)a, (U*)(a + N), v); } template auto make_vector(const std::array &a, T value = T()){ static_assert(I >= 1); static_assert(N >= 1); if constexpr (I == 1){ return std::vector(a[N - I], value); }else{ return std::vector(a[N - I], make_vector(a, value)); } } template std::ostream& operator<<(std::ostream &s, const std::vector &a){ for(auto it = a.begin(); it != a.end(); ++it){ if(it != a.begin()) s << " "; s << *it; } return s; } template std::istream& operator>>(std::istream &s, std::vector &a){ for(auto &x : a) s >> x; return s; } namespace solver{ void init(){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(12); std::cerr << std::fixed << std::setprecision(12); std::cin.exceptions(std::ios_base::failbit); } void solve(){ constexpr int MAX = 200000; std::vector a(MAX + 1); for(int i = 1; i <= MAX; ++i){ a[i] = std::log(i); } std::vector s(MAX + 1); for(int i = 0; i < MAX; ++i){ s[i + 1] = s[i] + a[i]; } //dump(s); int Q; std::cin >> Q; while(Q--){ int64_t N, M, K; std::cin >> N >> M >> K; long double flush = N != K ? s[N] - s[N - K] - s[K] : 0; long double straight = a[M] * (K - 1) + a[N - K + 1]; if(flush < straight){ std::cout << "Flush\n"; }else{ std::cout << "Straight\n"; } } } } int main(){ solver::init(); while(true){ try{ solver::solve(); }catch(const std::istream::failure &e){ break; } } return 0; }