CF682E Alyona and Triangles

You are given $ n $ points with integer coordinates on the plane. Points are given in a way such that there is no triangle, formed by any three of these $ n $ points, which area exceeds $ S $ . Alyona tried to construct a triangle with integer coordinates, which contains all $ n $ points and which area doesn't exceed $ 4S $ , but, by obvious reason, had no success in that. Please help Alyona construct such triangle. Please note that vertices of resulting triangle are not necessarily chosen from $ n $ given points.

In the first line of the input two integers $ n $ and $ S $ ( $ 3

Print the coordinates of three points — vertices of a triangle which contains all $ n $ points and which area doesn't exceed $ 4S $ . Coordinates of every triangle's vertex should be printed on a separate line, every coordinate pair should be separated by a single space. Coordinates should be an integers not exceeding $ 10^{9} $ by absolute value. It is guaranteed that there is at least one desired triangle. If there is more than one answer, print any of them.