#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
void func(void) {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
void printStack(stack<string> s) {
  if (s.empty()) return;
  string x = s.top();
  s.pop();
  printStack(s);
  cout << x;
  s.push(x);
}
long long binaryexp(long long n, long long p) {
  if (p == 0) return 1;
  if (p % 2 == 0)
    return binaryexp((n % 1000000009) * (n % 1000000009), p / 2);
  else
    return ((n % 1000000009) *
            binaryexp(((n % 1000000009) * (n % 1000000009)) % 1000000009,
                      (p - 1) / 2) %
            1000000009);
}
vector<long long> spf(10000001, 0);
void siv() {
  spf[1] = 1;
  for (long long i = 2; i < 10000001; i++) spf[i] = i;
  for (long long i = 4; i < 10000001; i += 2) {
    spf[i] = 2;
  }
  for (long long i = 3; i * i < 10000001; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 10000001; j += i) {
        if (spf[j] == j) {
          spf[j] = i;
        }
      }
    }
  }
}
int main() {
  long long T;
  cin >> T;
  for (long long t = 0; t < T; t++) {
    long long a, b, c;
    cin >> a >> b >> c;
    long long d = max(a, b);
    long long s = a + b - d;
    long long g = gcd(d, s);
    long long x = (c - 1) * s + g;
    if (x < d) {
      cout << "REBEL\n";
    } else
      cout << "OBEY\n";
  }
}
