// (◕ᴗ◕✿)

// #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define srep(i, s, n) for (ll i = s; i < (n); i++)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using vvv = vv<vc<T>>;
using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;
using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;
using uint = unsigned int;
using ull = unsigned long long;
const ld pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
// const ll mod = 1000000007;
const ll mod = 998244353;
inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }

#define debug(var) do { cerr << #var << " :\n"; view(var); } while(0)
template<typename T>void view(const T& e) {cerr << e;}
template<typename T1, typename T2>void view(const pair<T1, T2>& p) {cerr << "{" << p.first << ", " << p.second << "}";}
template<typename T>void view(const vc<T>& v) {for (const auto& e : v) {view(e);cerr << " ";} cerr << endl;}
template<typename T>void view(const vv<T>& vv) {for (const auto& v : vv) {view(v);} cerr << endl;}
template<typename T>void view(const set<T>& s) {for (const auto& e : s) {view(e);cerr << " ";} cerr << endl;}
template<typename T>void view(const multiset<T>& s) {for (const auto& e : s) {view(e);cerr << " ";} cerr << endl;}
template<typename T>void view(const unordered_set<T>& s) {for (const auto& e : s) {view(e);cerr << " ";} cerr << endl;}
template<typename T1, typename T2>void view(const map<T1, T2>& mp){for (const auto& e : mp) {view(e);cerr << " ";} cerr << endl;}

bool game(int h, int w){
    vi use(h + w, 0);
    vvi grid(h, vi(w, -1));
    auto f = [&](auto self, int v) -> bool{
        // debug(use);
        // debug(grid);
        if (v == h + w){
            int zero = 0, one = 0;
            rep(i, h) rep(j, w){
                zero += (grid[i][j] == 0);
                one += (grid[i][j] == 1);
            }
            if (zero >= one) return false;
            return true;
        }
        if (v % 2){ // one
            bool win = false;
            rep(s, h + w) if (!use[s]){
                vvi mygrid = grid;
                if (s < h) rep(j, w) grid[s][j] = 1;
                else rep(i, h) grid[i][s - h] = 1;
                use[s] = 1;
                if (self(self, v + 1)){
                    win = true;
                    use[s] = 0;
                    grid = mygrid;
                    break;
                }
                use[s] = 0;
                grid = mygrid;

            }
            return win;
        }else{
            bool win = true;
            rep(s, h + w) if (!use[s]){
                vvi mygrid = grid;
                if (s < h) rep(j, w) grid[s][j] = 0;
                else rep(i, h) grid[i][s - h] = 0;
                use[s] = 1;
                if (!self(self, v + 1)){
                    win = false;
                    use[s] = 0;
                    grid = mygrid;
                    break;
                }
                use[s] = 0;
                grid = mygrid;
            }
            return win;
        }
    };
    return f(f, 0);
}

bool solve(){
    // rep(i, 10) srep(j, i, 10) cout << i << ' ' << j << ' ' << game(i, j) << endl;
    int h, w; cin >> h >> w;
    cout << ((h + w) % 2 ? "sepa" : "ryota") << endl;
    return true;
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) solve();

    // while (solve());
}