B'Let us call a point of the plane admissible if its coordinates are positive integers less than or equal to 200 . There is an invisible rectangle such that: In order to guess it, you may ask at most 4 queries. In each query, you choose a nonempty subset of the admissible points and you are told how many of the chosen points are inside or on the boundary of the invisible rectangle. To ask a query (of the kind described in the statement), you shall print two lines: When you have identified the perimeter p of the invisible rectangle, you must print "! p " (without quotes) and terminate your program. If you ask more than 4 queries or if one of the queries is malformed, the interactor terminates immediately and your program receives verdict Wrong Answer. The interactor may be adaptive (i.e., the hidden rectangle may not be chosen before the beginning of the interaction). After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use: Hacks To hack a solution, use the following format. The input has only one line, containing the 4 integers x_0 , y_0 , x_1 , y_1 ( 1 <= x_0<x_1 <= 200 , 1 <= y_0 < y_1 <= 200 ) -- (x_0,y_0) is the bottom-left vertex of the hidden rectangle and (x_1, y_1) is the top-right vertex of the hidden rectangle. Note that for hacks the interaction won 't be adaptive. The following is an example of interaction for the first sample intended to show the format of the queries. begin{array}{l|l|l} text{Query (contestant program)} & text{Answer (interactor)} & text{Explanation} hline mathtt{? 4} & & text{We choose the $4$ vertices of} mathtt{13 5 13 80 123 5 123 80} & mathtt{4} & text{the hidden rectangle.} hline mathtt{? 5} & & text{We choose $4$ points just outside the hidden} mathtt{100 4 100 81 12 40 124 40 50 50} & mathtt{1}& text{rec'...