Garden Informatization

Stepan Petrovich's garden plot is a rectangle of size $a \times b$. The plot contains $n$ buildings, and the base of each building is a rectangle with sides parallel to the sides of the plot.

Inspired by his neighbors' success, Stepan Petrovich wants to plant $m$ types of fruit crops on his plot (Stepan Petrovich's plot is in a northern region, so $m = 1$ or $m = 2$). For each crop type, Stepan Petrovich wants to allocate a separate rectangular bed with sides parallel to the sides of the plot. Naturally, the beds cannot occupy the territory occupied by buildings or other beds.

Stepan Petrovich wants to place the beds so that their total area is maximized. The beds must not intersect, but they may touch each other.

Given the dimensions of the plot and the coordinates of the buildings, determine the optimal placement of the beds.

The first line of the input file contains two integers $n$ and $m$ ($0 \le n \le 10$; $1 \le m \le 2$).

The second line contains two integers $a$ and $b$ ($1 \le a, b \le 10000$).

The next $n$ lines each contain four integers $x_{i,1}, y_{i,1}, x_{i,2}, y_{i,2}$, the coordinates of two opposite corners of a building ($0 \le x_{i,1} < x_{i,2} \le a$, $0 \le y_{i,1} < y_{i,2} \le b$). Different buildings cannot intersect, but they may touch each other.

Output $m$ lines to the output file, each containing the coordinates of two opposite corners of a proposed bed. The coordinates must be integers (a placement maximizing the total area of the beds can always be achieved with rectangles of integer coordinates).

If in your solution Stepan Petrovich should plant fewer than $m$ beds, output the line "0 0 0 0" for the beds that should not be planted (see example 2).