B"This is an interactive problem. This is an easy version of the problem. The difference from the hard version is that in the easy version t=1 and the number of queries is limited to 20 . Polycarp is playing a computer game. In this game, an array consisting of zeros and ones is hidden. Polycarp wins if he guesses the position of the k -th zero from the left t times. Polycarp can make no more than 20 requests of the following type: In this (easy version) of the problem, this paragraph doesn't really make sense since t=1 always. To make the game more interesting, each guessed zero turns into one and the game continues on the changed array. More formally, if the position of the k -th zero was x , then after Polycarp guesses this position, the x -th element of the array will be replaced from 0 to 1 . Of course, this feature affects something only for t>1 . Help Polycarp win the game. First, your program must read two integers n and t ( 1 <= n <= 2 cdot 10^5 , t=1 ). Then t lines follow, each of which contains one integer k ( 1 <= k <= n ). It is guaranteed that at the moment of the request the array contains at least k zeros. In order to get the next value of k , you must output the answer for the current value of k . After that, you can make no more than 20 requests. Use the following format to output the answer (it is not a request, it doesn't count in 20 ): Positions in the array are numbered from left to right from 1 to n inclusive. After printing t answers, your program should exit immediately. In this task, the interactor is not adaptive. This means that within the same test, the hidden array and the queries do not change. In case of an incorrect query, -1 will be displayed. When this value is received, your program must immediately exit normally (for example, by calling exit(0)), otherwise, the testing "...