// Om shanti Om
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define fast_io                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
ll lcm(ll a, ll b) { return (a * b) / __gcd(a, b); }
ll modpow(ll a, ll b, ll m = LLONG_MAX)
{
    a %= m;
    ll ans = 1;
    while (b)
    {
        if (b & 1)
            ans = (ans * a) % m;
        a = (a * a) % m;
        b >>= 1;
    }
    return ans;
}
ll extended_gcd(ll a, ll b, ll &lastx, ll &lasty)
{
    ll q, r, temp, x = 0, y = 1;
    lastx = 1, lasty = 0;
    while (b)
    {
        q = a / b;
        r = a % b;
        a = b;
        b = r;
        temp = x;
        x = lastx - q * x;
        lastx = temp;
        temp = y;
        y = lasty - q * y;
        lasty = temp;
    }
    return a;
}
ll modInverse(ll a, ll m)
{
    ll x, y;
    ll g = extended_gcd(a, m, x, y);
    if (g != 1)
        return 0;
    else
        return (x % m + m) % m;
}
ll modDivide(ll a, ll b, ll m) { return ((a % m) * modInverse(b, m)) % m; }
ll modMultiply(ll a, ll b, ll m)
{
    a %= m;
    ll ans = 0;
    while (b)
    {
        if (b & 1)
            ans = (ans + a) % m;
        a = (a + a) % m;
        b >>= 1;
    }
    return ans;
}
ll nCr(ll n, ll r, ll p)
{
    if (r > n)
        return 0;
    if (r > n - r)
        r = n - r;
    ll ans = 1;
    for (ll i = 1; i <= r; i++)
    {
        ans = modMultiply(ans, n - i + 1, p);
        ans = modDivide(ans, i, p);
    }
    return ans;
}
// const int mod = 1e9+7;
const int mod = 1e9 + 7;
const int INF = 1e18;
int dp[100010][2];

void solv(int Try_Try_____________________________)
{   
    int a[3];
    for(int i=0;i<3;i++)cin>>a[i];
    if(a[1] > a[0] && a[1] > a[2])cout<<"PEAK\n";
    else if(a[1] > a[0] && a[1] < a[2])cout<<"STAIR\n";
    else cout<<"NONE\n";
}   

signed main()
{
    fast_io 
    int t = 1;
    
    // sieve();
    cin >> t;
    for (int i = 1; i <= t; i++)
    {
        solv(i);
    }
}