B"This is an interactive problem. Kochiya Sanae is playing with magnets. Realizing that some of those magnets are demagnetized, she is curious to find them out. There are n magnets, which can be of the following 3 types: Note that you don't know the types of these magnets beforehand. You have a machine which can measure the force between the magnets, and you can use it at most n+ lfloor log_2n rfloor times. You can put some magnets to the left part of the machine and some to the right part of the machine, and launch the machine. Obviously, you can put one magnet to at most one side (you don't have to put all magnets). You can put the same magnet in different queries. Then the machine will tell the force these magnets produce. Formally, let n_1,s_1 be the number of N and S magnets correspondently on the left and n_2,s_2 -- on the right. Then the force between them would be n_1n_2+s_1s_2-n_1s_2-n_2s_1 . Please note that the force is a signed value. However, when the absolute value of the force is strictly larger than n , the machine will crash into pieces. You need to find all magnets of type - (all demagnetized ones), without breaking the machine. Note that the interactor is not adaptive. The types of the magnets are fixed before the start of the interaction and do not change with queries. It is guaranteed that there are at least 2 magnets whose type is not -, and at least 1 magnet of type -. The first line contains a single integer t ( 1 <= q t <= q 100 ) -- the number of test cases. For each test case you should start by reading an integer n ( 3 <= q n <= q 2000 ) -- the number of the magnets. It is guaranteed that the total sum of all n over all test cases doesn't exceed 2000 . After that you can put some magnets into the machine and make a query from the statement. You have to print each query in three lines: After printing a query do not forget to output end of line a"...