B'This is an interactive problem. Farmer Stanley grows corn on a rectangular field of size n x m meters with corners in points (0, 0) , (0, m) , (n, 0) , (n, m) . This year the harvest was plentiful and corn covered the whole field. The night before harvest aliens arrived and poisoned the corn in a single 1 x 1 square with sides parallel to field borders. The corn inside the square must not be eaten, but you cannot distinguish it from ordinary corn by sight. Stanley can only collect a sample of corn from an arbitrary polygon and bring it to the laboratory, where it will be analyzed and Stanley will be told the amount of corn in the sample that was poisoned. Since the harvest will soon deteriorate, such a study can be carried out no more than 5 times. More formally, it is allowed to make no more than 5 queries, each of them calculates the area of intersection of a chosen polygon with a square of poisoned corn. It is necessary to find out the coordinates of the lower-left corner of the drawn square (the vertex of the square with the smallest x and y coordinates). First line contains two integers n and m ( 1 <= n, m <= 100 ) -- field sizes. In order to query the area of intersection of a polygon with k ( 3 <= k <= 1000 ) vertices at points with coordinates (x_1, y_1), ; ... , ;(x_k, y_k) with a square of poisoned corn print k+1 lines. In the first of these lines print "? k". In the i -th of the next k lines print two real numbers x_i and y_i ( |x_i|, |y_i| <= 10^4 ) with at most 15 digits after decimal place. The polygon must have strictly positive area and contain no self-intersections. In response to this query you will receive a real number s ( 0 <= s <= 1 ) with 15 digits after decimal place -- the area of intersection of the square with the given polygon. If the polygon is invalid, there is '...