We will define a line by three coefficients: $a$, $b$, and $c$.
Such a line contains points $(x, y)$ that satisfy the equation $a x + b y + c = 0$.

Output two lines specifying the borders.
On each line, print three integers: $a$, $b$, and $c$, the coefficients of a line equation ($|a|, |b|, |c| \le 10^9$).

The distance between the lines must be the maximum possible.
It can be shown that there exists an optimal answer that satisfies the above constraints.
If there are several optimal answers, print any one of them.
