This is a run-twice (communication) interactive problem. There are two players: Player A and Player B. The jury (otherwise known as the interactor of this problem) will first interact with player A. After player A ends their interaction, the jury will interact with player B. Note that player A and player B may not directly pass information to each other; both players are only able to send information to or receive information from the jury. Before the interaction, the jury determines an integer (n) and a permutation (p)(^{\text{∗}}) of the integers from (1) to (n) exactly once. These values are consistent across both players. Player A receives the value of (n) and all elements of (p) from the jury. Then, Player A must send a binary integer (x) (that is, (x) must equal (0) or (1)) back to the jury. Player B receives the value of (n) and the integer (x) (the same integer that player A sent) from the jury. However, the permutation (p) is not given to player B. Player B's task is to determine the position of integer (n) in (p). To do so, Player B can ask the jury at most (30) queries in the following form: Choose any two integers (l) and (r) ((l \leq r)) and the jury will respond with (\max(p_{l}, p_{l+1}, \ldots, p_{r}) - \min(p_{l}, p_{l+1}, \ldots, p_{r})). Player A wants to ensure that player B can determine the position of (n). Your task is to act as both players and determine an optimal interaction strategy for both players so that player B determines the position of (n) correctly. First Run Your code will run exactly twice on each test. On the first run, you will be Player A. Input The first line of the input contains the string first . The purpose of this is so your program recognizes that this is its first run, and it should act as Player A. The second line of the input contains exactly one integer (t) — the number of test cases ((1 \le t \le 100)). The