There is a conveyor with 120 rows and 120 columns. Each row and column is numbered from 0 to 119 , and the cell in i -th row and j -th column is denoted as (i, j) . The top leftmost cell is (0, 0) . Each cell has a belt, and all belts are initially facing to the right. Initially, a slime ball is on the belt of (0, 0) , and other belts are empty. Every second, the state of the conveyor changes as follows: There are q queries, each being three integers t , x , and y . You have to find out if there is a slime at the cell (x, y) after t seconds from the start. Can you do it? The first line contains one integer q ( 1 <= q <= 10^4 ) -- the number of queries. The only line of each query contains three integers t , x , and y ( 0 <= t <= 10^{18} , 0 <= x, y < 120 ). Print the answer for each test case, one per line. If there is a slime ball in the cell (x, y) after t seconds from the initial state, print "YES". Otherwise, print "NO". The state of conveyor with t = 0 . Red arrow represents the direction of each belt, and blue figure represents slime. The state of conveyor with t = 1 . The state of conveyor with t = 2 .