#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (ssize(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

void solve() {
  ll H, W;
  cin >> H >> W;
  ll rK = min(H, W), sK = min(H, W + 1);
  if (sK > rK) {
    ll w = (H - 1) * H / 2 - (H - rK - 1) * (H - rK) / 2;
    ll b = W * (W + 1) / 2 - (W - rK - 1) * (W - rK) / 2;
    cout << (b - w >= 0 ? "sepa\n" : "ryota\n");
  } else {
    ll w = H * (H + 1) / 2 - (H - rK) * (H - rK + 1) / 2;
    ll b = (W - 1) * W / 2 - (W - sK - 1) * (W - sK) / 2;
    cout << (b - w >= 0 ? "sepa\n" : "ryota\n");
  }
}

int main() {
  int T;
  cin >> T;
  rep(T) solve();
}