#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

ll H,W,D;

void solve(){
    cin >> H >> W >> D;
    if(H%2){
        if(W*W+1<=D*D) {
            cout << "N" << endl;
            return;
        }
    }
    else{
        if(W<=D){
            cout << "N" << endl;
            return;
        }
    }
    if(W%2){
        if(H*H+1<=D*D) {
            cout << "N" << endl;
            return;
        }
    }
    else{
        if(H<=D){
            cout << "N" << endl;
            return;
        }
    }
    cout << "S" << endl;
}

int main(){
    int T;cin >> T;
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    rep(i,T) solve();
}