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.BufferedReader; 
import java.io.IOException; 
import java.io.InputStreamReader;
import java.util.*;  
import java.io.*;
  
public class abc
{ 
	static PrintWriter pw;
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
 
    public static int gcd(int a,int b)
    {
        return b==0?a:gcd(b,a%b);
    }
 
    public static boolean isPrime(long n)
    {
        if(n==2)return true;
        int i=2;
        while(i*i<=n)
        {
            if(n%i==0) return false;
            i++;
        }
        return true;
    }
    
    public static long[] remove(long n)
    {
        long res[]=new long[1000000000];
        long rese=0;
        int i=0;
        while(n>0)
        {
            long dig=n%10;
            n=n/10;
            if(dig>0)
            {
                rese=dig;
                	res[i++]=rese;
            }
        }
        return res;
    }
    static int ceil(int x, int y) {
		return (x % y == 0 ? x / y : (x / y + 1));
	}
 
	static long ceil(long x, long y) {
		return (x % y == 0 ? x / y : (x / y + 1));
	}
 
	static int max(int x, int y) {
		return Math.max(x, y);
	}
 
	static int min(int x, int y) {
		return Math.min(x, y);
	}
 
	static int abs(int x) {
		return Math.abs(x);
	}
 
	static long abs(long x) {
		return Math.abs(x);
	}
 
	static int log2(int N) {
		int result = (int) (Math.log(N) / Math.log(2));
		return result;
	}
 
	static long max(long x, long y) {
		return Math.max(x, y);
	}
 
	static long min(long x, long y) {
		return Math.min(x, y);
	}
	public static class pair{
		int x;
		int y;
		public pair(int a,int b){
		   x=a;
		   y=b;
		}
	}
	
	public static class Comp implements Comparator<pair>{
		public int compare(pair a,pair b){
		    if(a.x!=b.x){
		        return a.x-b.x;
		    }else{
		        return a.y-b.y;
		   }
		}
	}
	
	
    public static void main(String[] args) 
    {
    	
        FastReader ob=new FastReader();
        pw = new PrintWriter(System.out);
        int n = ob.nextInt();
        
        for (int i = 0; i < n; i++)
        {
        	int c = ob.nextInt();
        	int sum = ob.nextInt();
        	int k = ob.nextInt();
        	int gcd=gcd(c,sum);
        	c/=gcd;sum/=gcd;
        	int max=Math.max(c,sum);
        	int min=Math.min(c, sum);
        	c=min;
        	sum=max;
        	if((long)(k-1)*c+1<sum)
        	pw.println("REBEL");
        	else
        		pw.println("OBEY");
        }
        pw.flush();
    }
}