B"This is the easy version of the problem. The only difference is that here k=2 . You can make hacks only if both the versions of the problem are solved. This is an interactive problem. Every decimal number has a base k equivalent. The individual digits of a base k number are called k -its. Let's define the k -itwise XOR of two k -its a and b as (a + b) bmod k . The k -itwise XOR of two base k numbers is equal to the new number formed by taking the k -itwise XOR of their corresponding k -its. The k -itwise XOR of two decimal numbers a and b is denoted by a oplus_{k} b and is equal to the decimal representation of the k -itwise XOR of the base k representations of a and b . All further numbers used in the statement below are in decimal unless specified. When k = 2 (it is always true in this version), the k -itwise XOR is the same as the bitwise XOR. You have hacked the criminal database of Rockport Police Department (RPD), also known as the Rap Sheet. But in order to access it, you require a password. You don't know it, but you are quite sure that it lies between 0 and n-1 inclusive. So, you have decided to guess it. Luckily, you can try at most n times without being blocked by the system. But the system is adaptive. Each time you make an incorrect guess, it changes the password. Specifically, if the password before the guess was x , and you guess a different number y , then the system changes the password to a number z such that x oplus_{k} z=y . Guess the password and break into the system. The first line of input contains a single integer t ( 1 <= q t <= q 10 ,000 ) denoting the number of test cases. t test cases follow. The first line of each test case contains two integers n ( 1 <= q n <= q 2 cdot 10^5 ) and k ( k=2 ). It is guaranteed that the sum of n o"...