Sheldon is a little geek living in Texas. While his friends like to play outside, little Sheldon likes to play around with ICs and lasers in his house. He decides to build N clap activated toggle machines each with one power inlet and one outlet. Each machine works when its power source inlet is receiving power. When the machine is in 'ON' state and is receiving power at its inlet, it makes power available at its power outlet to which a bulb or another ToGgLe machine could be attached.

Suppose Sheldon attached 2 such machines to one another with the power inlet of the first machine attached to a power source at his house and the outlet of the second machine to a bulb. Initially both machines are in 'OFF' state and power source to first machine is off too. Now the power source is switched on. The first machine receives power but being in the 'OFF' state it does not transmit any power. Now on clapping the first ToGgLe machine toggles to 'ON' and the second machine receives power. On clapping once more the first toggles to 'OFF' and the second toggles to 'ON'. But since the second ToGgLe machine receives no power the bulb does not light up yet. On clapping once more, the first machine which is still receiving power from the source toggles to 'ON' and the second which was already 'ON' does not toggle since it was not receiving power. So both the machine are in 'ON' state and the bulb lights up and little Sheldon is happy.

But when Sheldon goes out for a while, his evil twin sister attaches N such ToGgLe machines (after making sure they were all in 'OFF' state) and attaches the first to a power source (the power source is initially switched off) and the last ToGgLe machine to a bulb. Sheldon is horrified to find that his careful arrangement has been disturbed.

Coders, help the poor boy by finding out if clapping k times for the N ToGgLe machines (all in 'OFF' state with the first one connected to a switched off power source and last one to a bulb) would light the bulb. Hurry before Sheldon has a nervous breakdown!

-----Input-----
First line has number of test cases, T.

Following T lines have N, k separated by a single space where N is the number of 
ToGgLe machines and k is the number of times Sheldon clapped.

-----Output-----
T lines with cach line of the form: "ON" (just the word on without the double quotes) if the bulb is 'ON' for the 
test case numbered n and "OFF" (just the word off without the double quotes) if the bulb is 'OFF' for the test case numbered n.


-----Example-----
Input:
4
4 0
4 47
1 0
1 1

Output:
OFF
ON
OFF
ON

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
n = int(input())
while n > 0:
	i = 1
	(a, b) = (int(i) for i in input().split())
	if (b + 1) % (i << a) == 0:
		print('ON')
	else:
		print('OFF')
	n = n - 1


for _ in range(int(input())):
	(n, k) = input().split()
	n = int(n)
	k = int(k)
	p = 2 ** n - 1
	if p == k:
		print('ON')
	elif p < k:
		if (k - p) % 2 ** n == 0:
			print('ON')
		else:
			print('OFF')
	else:
		print('OFF')


import sys
import math
t = int(sys.stdin.readline())
while t:
	s = sys.stdin.readline()
	if len(s) == 0:
		break
	s1 = s.split(' ')
	n = int(s1[0])
	k = int(s1[1])
	if (k + 1) % int(math.pow(2, n)) == 0:
		print('ON')
	else:
		print('OFF')
	t -= 1