CF452B.4-point polyline

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.

给你一个从 $(0, 0)$ 到 $(n, m)$（含端点）的矩形格点网格。你需要从中恰好选择 4 个互不相同的点，用以构造一条折线（该折线允许自相交和自接触）。要求该折线的总长度尽可能长。

由点 $p_1, p_2, p_3, p_4$ 定义的折线由线段 $p_1p_2$、$p_2p_3$、$p_3p_4$ 组成，其长度为这三条线段长度之和。

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.

输入仅包含一行，其中有两个整数 $n$ 和 $m$（$0 ≤ n, m ≤ 1000$）。保证网格中至少包含 4 个不同的点。

Print 4 lines with two integers per line separated by space — coordinates of points _p_1, _p_2, _p_3, _p_4 in order which represent the longest possible polyline.

Judge program compares your answer and jury's answer with 10 - 6 precision.

输出 4 行，每行包含两个由空格分隔的整数——按顺序表示构成最长可能折线的点 $p_1,\,p_2,\,p_3,\,p_4$ 的坐标。

评测程序将使用 $10^{-6}$ 的精度比较你的答案与标准答案。