After some programming contest Roma decided to try himself in tourism. His home country Uzhlyandia is a Cartesian plane. He wants to walk along each of the Main Straight Lines in Uzhlyandia. It is known that each of these lines is a straight line parallel to one of the axes (i.e. it is described with the equation x = a or y = a , where a is integer called the coordinate of this line). Roma lost his own map, so he should find out the coordinates of all lines at first. Uncle Anton agreed to help him, using the following rules: Initially Roma doesn't know the number of vertical and horizontal lines and their coordinates; Roma can announce integer coordinates of some point in Uzhlandia, and Anton then will tell him the minimum among the distances from the chosen point to each of the lines. However, since the coordinates of the lines don't exceed 10 8 by absolute value, Roma can't choose a point with coordinates exceeding 10 8 by absolute value. Uncle Anton is in a hurry to the UOI (Uzhlandian Olympiad in Informatics), so he can only answer no more than 3·10 5 questions. The problem is that Roma doesn't know how to find out the coordinates of the lines. Write a program that plays Roma's role and finds the coordinates. There is no input initially. Your program should make queries to get information. It is guaranteed that the number of horizontal and vertical lines is at least 1 and less than or equal to 10 4 for each type. To make a query, print a line " 0 x y " (- 10 8 ≤ x , y ≤ 10 8 ), where x and y are the coordinates of the point. After each query you need to print end-of-line, make " flush " operation, and then read the answer to the query — the minimum among the distances prom this point to the Main Straight Lines of Uzhlyandia. You can do no more than 3·10 5 queries. When you are ready to print the answer, print three lines: In the first line print " 1 n m ", where n is the number of vertical lines (parallel to OY ), and m is the number of horizontal line