#include <bits/stdc++.h>   using namespace std;   long long gcd(long long x, long long y) {     if (x == 0) return y;     return gcd(y % x, x);   }   int main() {     int t;     long long r, b, k;     scanf( %d , &t);     while (t--) {       scanf( %I64d%I64d%I64d , &r, &b, &k);       long long Gcd = gcd(r, b);       r /= Gcd;       b /= Gcd;       if (r <= (k - 1) * b + 1 && b <= (k - 1) * r + 1)         printf( OBEY n );       else         printf( REBEL n );     }   }   