#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  int T;
  int r, b, k;
  cin >> T;
  while (T--) {
    cin >> r >> b >> k;
    int t = gcd(r, b);
    r /= t;
    b /= t;
    int mx = max(r, b);
    int mn = min(r, b);
    int mid = ((mx - 2) / mn) + 1;
    if (mid >= k)
      cout << "rebel" << endl;
    else
      cout << "obey" << endl;
  }
  return 0;
}
