You are given a rectangular grid of lattice points from (0, 0) to (n, m) inclusive. You have to choose exactly 4 different points to build a polyline possibly with self-intersections and self-touching. This polyline should be as long as possible. A polyline defined by points p 1, p 2, p 3, p 4 consists of the line segments p 1 p 2, p 2 p 3, p 3 p 4 , and its length is the sum of the lengths of the individual line segments.

输入描述:

The only line of the input contains two integers n and m(0 ≤ n, m ≤ 1000). It is guaranteed that grid contains at least 4 different points.

输出描述:

Print 4 lines with two integers per line separated by space — coordinates of points p1, p2, p3, p4 in order which represent the longest possible polyline.Judge program compares your answer and jury's answer with 10 - 6 precision.