Anniversary Cake

Adam and Anton are celebrating the second anniversary of failing their Math Logic exam. After a careful search in the local supermarket they bought a rectangular cake with integer side lengths $w$ and $h$, and two candles. Place the cake on the plane so that its corners are $(0, 0)$, $(w, 0)$, $(w, h)$, and $(0, h)$.

Adam put the two candles at two different integer points strictly inside the cake and gave Anton a knife. Anton cuts the cake along one straight segment. The cut starts and ends at integer points on the sides of the cake, it must not touch either candle, and each of the two pieces must hold exactly one candle.

The figure shows a $7 \times 3$ cake with candles at $(2, 2)$ and $(3, 2)$. The drawn cut goes through $(0, 0)$ and $(4, 3)$ and puts the candles in different pieces. Many cuts work, and the output section fixes which one to print.

One line holds six integers $w$, $h$, $ax$, $ay$, $bx$, $by$. The side lengths of the cake are $w$ and $h$, the first candle is at $(ax, ay)$, and the second candle is at $(bx, by)$.

$3 \le w, h \le 10^9$, $0 < ax, bx < w$, $0 < ay, by < h$, and $ax \ne bx$ or $ay \ne by$.

Print four integers $sx$, $sy$, $ex$, $ey$ on one line: the start point and the end point of the cut. Both points lie on the sides of the cake.

Many cuts satisfy the conditions, so print only the one fixed by this rule.

• If $ax \ne bx$, let $m = \min(ax, bx)$ and cut from $(m, 0)$ to $(m + 1, h)$.
• If $ax = bx$, let $m = \min(ay, by)$ and cut from $(0, m)$ to $(w, m + 1)$.

This cut always satisfies the conditions above.