B'Carl has n coins of various colors, and he would like to sort them into piles. The coins are labeled 1,2, ldots,n , and each coin is exactly one of red, green, or blue. He would like to sort the coins into three different piles so one pile contains all red coins, one pile contains all green coins, and one pile contains all blue coins. Unfortunately, Carl is colorblind, so this task is impossible for him. Luckily, he has a friend who can take a pair of coins and tell Carl if they are the same color or not. Using his friend, Carl believes he can now sort the coins. The order of the piles doesn 't matter, as long as all same colored coins are in the one pile, and no two different colored coins are in the same pile. His friend will answer questions about multiple pairs of coins in batches, and will answer about all of those pairs in parallel. Each coin should be in at most one pair in each batch. The same coin can appear in different batches. Carl can use only 7 batches. Help him find the piles of coins after sorting. You will be given multiple test cases. The first line contains an integer t (1 <= q t <= q 5 ) -- the number of test cases. The first line of each test case contains one integer n ( 1 <= q n <= q 10^5 ) -- the number of coins. If you read in a value of -1 here, that means that you printed an invalid answer in the previous case and exit immediately to avoid getting other verdicts. To ask a question, print "Q k x_1 y_1 ldots x_k y_k " ( 1 <= q k <= q n/2, 1 <= q x_i,y_i <= q n, x_i neq y_i ). k denotes the number of pairs in the batch, and x_i, y_i denote the i -th pair of coins in the batch. A coin can only appear at most once in a batch. All x_i and y_i should be distinct. The judge will respond with a bitstring of length k , where the i -th character is "1" if x_i and y_i are the same color, and "0" otherwise. The judge will respond '...