#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int mex(vector<int> v){
    set<int> used;
    for(int x: v) used.insert(x);
    for(int i = 0; ; i++){
        if(used.count(i) == 0) return i;
    }
}

void test(int n){
    vector<int> grundy(n+1);
    grundy[0] = 0;
    grundy[1] = 0;
    for(int i = 2; i <= n; i++){
        vector<int> v;
        for(int j = 0; j+2 <= i; j++){
            int k = i-(j+2);
            v.push_back(grundy[j]^grundy[k]);
        }
        grundy[i] = mex(v);
    }
    for(int i = 0; i <= n; i++){
        if(grundy[i] == 0) cout << i << ' ';
        // cout << i << ':' << grundy[i] << endl;
    }
    cout << endl;
}

const ll inf = 3e18;

void solve(){
    ll h, w, d; cin >> h >> w >> d;
    auto calc = [&](){
        if(h%2 == 0){
            return w*w;
        }else{
            return w*w+1;
        }
    };
    ll mn = calc();
    swap(h, w);
    chmin(mn, calc());
    if(mn <= d*d){
        cout << "N" << endl;
    }else{
        cout << "S" << endl;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}