Problem: You are a rebel leader and you are planning to start a revolution in your country. But the evil Government found out about your plans and set your punishment in the form of correctional labor.

You must paint a fence which consists of 10^{100} planks in two colors in the following way (suppose planks are numbered from left to right from 0): 

  * if the index of the plank is divisible by r (such planks have indices 0, r, 2r and so on) then you must paint it red; 
  * if the index of the plank is divisible by b (such planks have indices 0, b, 2b and so on) then you must paint it blue; 
  * if the index is divisible both by r and b you can choose the color to paint the plank; 
  * otherwise, you don't need to paint the plank at all (and it is forbidden to spent paint on it). 



Furthermore, the Government added one additional restriction to make your punishment worse. Let's list all painted planks of the fence in ascending order: if there are k consecutive planks with the same color in this list, then the Government will state that you failed the labor and execute you immediately. If you don't paint the fence according to the four aforementioned conditions, you will also be executed.

The question is: will you be able to accomplish the labor (the time is not important) or the execution is unavoidable and you need to escape at all costs.

Input

The first line contains single integer T (1 ≤ T ≤ 1000) — the number of test cases.

The next T lines contain descriptions of test cases — one per line. Each test case contains three integers r, b, k (1 ≤ r, b ≤ 10^9, 2 ≤ k ≤ 10^9) — the corresponding coefficients.

Output

Print T words — one per line. For each test case print REBEL (case insensitive) if the execution is unavoidable or OBEY (case insensitive) otherwise.

Example

Input


4
1 1 2
2 10 4
5 2 3
3 2 2


Output


OBEY
REBEL
OBEY
OBEY

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.text.*;
import java.lang.*;
import java.math.*;
 
public class Myclass{
    //static ArrayList[] a=new ArrayList[30];
   
     public void solve () throws FileNotFoundException  {
    	InputReader in = new InputReader(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int t = in.nextInt();
        while(t-- > 0) {
        	long a = in.nextLong();
        	long b = in.nextLong();
        	long k = in.nextLong();
        	long gcd = GCD(a,b);
        	long diff = Math.max(a, b) - gcd ;
        	long can = (long) Math.ceil(diff / (Math.min(a, b)*1.0));
        	if(can >= k)
        		pw.println("REBEL");
        	else
        		pw.println("OBEY");
        }
        pw.flush();
        pw.close();
    }
    public static void main(String[] args) throws Exception {
        
        
        new Thread(null,new Runnable() {
            public void run() {
                    try {
						new Myclass().solve();
					} catch (FileNotFoundException e) {
						// TODO Auto-generated catch block
						e.printStackTrace();
					}
            }
        },"1",1<<26).start();
        
        
    }
   
    static void debug(Object... o) {
        System.out.println(Arrays.deepToString(o));
        }
        
        static class InputReader 
        {
        private final InputStream stream;
        private final byte[] buf = new byte[8192];
        private int curChar, snumChars;
        private SpaceCharFilter filter;
 
        public InputReader(InputStream stream) 
        {
            this.stream = stream;
        }
        public int snext() 
        {
            if (snumChars == -1)
                throw new InputMismatchException();
            if (curChar >= snumChars) 
            {
                curChar = 0;
                try 
                {
                    snumChars = stream.read(buf);
                } 
                catch (IOException e) 
                {
                    throw new InputMismatchException();
                }
                if (snumChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }
 
        public int nextInt() 
        {
            int c = snext();
            while (isSpaceChar(c)) 
            {
                c = snext();
            }
            int sgn = 1;
            if (c == '-')
            {
                sgn = -1;
                c = snext();
            }
            int res = 0;
            do 
            {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = snext();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public long nextLong()
        {
            int c = snext();
            while (isSpaceChar(c)) 
            {
                c = snext();
            }
            int sgn = 1;
            if (c == '-') 
            {
                sgn = -1;
                c = snext();
            }
            long res = 0;
            do 
            {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = snext();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public int[] nextIntArray(int n) 
        {
            int a[] = new int[n];
            for (int i = 0; i < n; i++) 
            {
                a[i] = nextInt();
            }
            return a;
        }
 
        public String readString()
        {
            int c = snext();
            while (isSpaceChar(c)) 
            {
                c = snext();
            }
            StringBuilder res = new StringBuilder();
            do 
            {
                res.appendCodePoint(c);
                c = snext();
            } while (!isSpaceChar(c));
            return res.toString();
        }
 
        public String nextLine() 
        {
            int c = snext();
            while (isSpaceChar(c))
                c = snext();
            StringBuilder res = new StringBuilder();
            do 
            {
                res.appendCodePoint(c);
                c = snext();
            } while (!isEndOfLine(c));
            return res.toString();
        }
 
        public boolean isSpaceChar(int c) 
        {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
 
        private boolean isEndOfLine(int c) 
        {
            return c == '\n' || c == '\r' || c == -1;
        }
 
        public interface SpaceCharFilter
        {
            public boolean isSpaceChar(int ch);
        }
    }
        public static long mod = 1000000007;
        public static int d;
        public static int p;
        public static int q;
        public void extended(int a,int b) {
            if(b==0) {
                d=a;
                p=1;
                q=0;
            }
            else
            {
                extended(b,a%b);
                int temp=p;
                p=q;
                q=temp-(a/b)*q;
            }
        }
       
        
        public static long binaryExponentiation(long x,long n)
        {
            long result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=result * x;
                x=x*x;
                n=n/2;
            }
            return result;
        }
        
        public static long[] shuffle(long[] a,Random gen)
        {
            int n = a.length;
            for(int i=0;i<n;i++)
            {
                int ind = gen.nextInt(n-i)+i;
                long temp = a[ind];
                a[ind] = a[i];
                a[i] = temp;
            }
            return a;
        }
        
        public static void swap(int a, int b){
            int temp = a;
            a = b;
            b = temp;
        }
        
        public static HashSet<Integer> primeFactorization(int n)
        {
            HashSet<Integer> a =new HashSet<Integer>();
            for(int i=2;i*i<=n;i++)
            {
                while(n%i==0)
                {
                    a.add(i);
                    n/=i;
                }
            }
            if(n!=1)
                a.add(n);
            return a;
        }
        
        public static void sieve(boolean[] isPrime,int n)
        {
            for(int i=1;i<n;i++)
                isPrime[i] = true;
            
            isPrime[0] = false;
            isPrime[1] = false;
            
            for(int i=2;i*i<n;i++)
            {
                if(isPrime[i] == true)
                {
                    for(int j=(2*i);j<n;j+=i)
                        isPrime[j] = false;
                }
            }
        }
        
        public static long GCD(long n,long m)
        {
            if(m==0)
                return n;
            else
                return GCD(m,n%m);
        }
        public static long LCM (long a,long b) {
            return ((a*b)/(GCD(a,b)));
        }
        
        static class pair implements Comparable<pair>
        {
           Long x, y;
            
            pair(long seg,long minValue)
            {
                this.x=seg;
                this.y=minValue;
            }

            public int compareTo(pair o) {
                int result = x.compareTo(o.x);
                if(result==0)
                    result = y.compareTo(o.y);
                
                return result;
            }  
            
            public String toString()
            {
                return x+" "+y;
            }
            
            public boolean equals(Object o)
            {
                if (o instanceof pair)
                {
                    pair p = (pair)o;
                    return p.x == x && p.y == y ;
                }
                return false;
            }
            
            public int hashCode()
            {
                return new Double(x).hashCode()*31 + new Long(y).hashCode();
            }
        }
        public static int binaryExponentiation(int x,int n)
        {
            int result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=result * x;
                x=x*x;
                n=n/2;
            }
            return result;
        }
        
       
        
        public static int modularExponentiation(int x,int n,int M)
        {
            int result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=(result * x)%M;
                x=(x%M*x)%M;
                n=n/2;
            }
            return result;
        }
        
        public static long modularExponentiation(long x,long n,long M)
        {
            long result=1;
            while(n>0)
            {
                if(n % 2 ==1)
                    result=(result%M * x%M)%M;
                x=(x%M * x%M)%M;
                n=n/2;
            }
            return result;
        }
        
        public static long modInverse(int A,int M)
        {
            return modularExponentiation(A,M-2,M);
        }
        
        public static long modInverse(long A,long M)
        {
            return modularExponentiation(A,M-2,M);
        }
        static class Segment{ 
        	long seg[][]; 
        	long a[];
        	long lazy[];
            Segment (int n){
        		seg=new long[4*n][2];
        		lazy=new long[4*n];
        	}
            public void build(int node,int start,int end) {
            	if(start==end) {
            		seg[node][0]=0L;
            		seg[node][1] = 0L;
            		return ;
            	}
            	int mid=(start+end)/2;
            	build(2*node+1,start,mid);
            	build(2*node+2,mid+1,end);
            }
            /*public void update(int node,int start,int end,int id,int val) {
            	if(start==end) {
            		seg[node][]=a[start]=val;
            		return;
            	}
            	int mid=(start+end)/2;
            	if(id>=start && id<=mid) {
            		update(2*node+1,start,mid,id,val);
            	}
            	else
            		update(2*node+2,mid+1,end,id,val);
            	seg[node]=seg[2*node+1]+seg[2*node+2];
            }
            public long query(int node,int start,int end,int l,int r) {
            	if(l>end || r<start)
            		return 0;
            	if(start>=l && end<=r)
            		return seg[node];
            	
            	int  mid=(start+end)/2;
            	return query(2*node+1,start,mid,l,r) + query(2*node+2,mid+1,end,l,r);
            }*/
            public void updateRange(int node,int start,int end,int l,int r,int val) {
        
            	if(lazy[node]!=0) {
            		seg[node][0]+=lazy[node];
            		seg[node][1]+=lazy[node];

            		if(start!=end) {
            			lazy[2*node+1]+=lazy[node];
            			lazy[2*node+2]+=lazy[node];
            		}
            		lazy[node]=0;
            	}
            	if(l>end || r<start)
            		return ;
            	if(start>=l && end<=r) {
            		seg[node][0]+=val;
            		seg[node][1]+=val;
            		if(start!=end) {
            			lazy[2*node+1]+=val;
            			lazy[2*node+2]+=val;
            		}
            		lazy[node]=0;
            		return ;
            	}
            	int mid=(start+end)/2;
            	updateRange(2*node+1,start,mid,l,r,val);
            	updateRange(2*node+2,mid+1,end,l,r,val);
            	seg[node][0]=Math.min(seg[2*node+1][0] , seg[2*node+2][0]);
            	seg[node][1]=Math.max(seg[2*node+1][1] , seg[2*node+2][1]);

            }
            public pair queryRange(int node,int start,int end,int l,int r) {
            	if(l>end || r<start)
            		return new pair(Long.MAX_VALUE,Long.MIN_VALUE);
            	if(lazy[node]!=0) {
            		seg[node][0]+=lazy[node];
            		seg[node][1]+=lazy[node];
            		if(start!=end) {
            			lazy[2*node+1]+=lazy[node];
            			lazy[2*node+2]+=lazy[node];
            		}
            		lazy[node]=0;
            	}
            	if(start>=l && end<=r)
            		return new pair(seg[node][0],seg[node][1]);
            	
            	int  mid=(start+end)/2;
            	pair p1 = queryRange(2*node+1,start,mid,l,r);
            	pair p2 = queryRange(2*node+2,mid+1,end,l,r);
            	return new pair(Math.min(p1.x, p2.x) , Math.max(p1.y, p2.y));
            }
            
        }

        
         
}