## USACO 2019 February Contest, Gold

## Problem 3. Painting the Barn

Contest has ended.

**Log in to allow submissions in analysis mode**

We can describe the side of the barn as a 2D $x$-$y$ plane, on which Farmer John paints $N$ rectangles, each with sides parallel to the coordinate axes, each described by the coordinates of its lower-left and upper-right corner points.

Farmer John wants to apply several coats of paint to the barn so it doesn't need to be repainted again in the immediate future. However, he doesn't want to waste time applying an excessive number of coats of paint. It turns out that $K$ coats of paint is the optimal amount. However, looking at the amount of area covered by $K$ coats of paint, he is not very happy. He is willing to paint up to two additional rectangles to try and increase this area, as long as these two rectangles are disjoint (not sharing any positive amount of area in common). Note that he can also decide to paint zero new rectangles or just one new rectangle if this ends up being the best thing to do.

#### INPUT FORMAT (file paintbarn.in):

The first line of input contains $N$ and $K$ ($1 \leq K, N \leq 10^5$). Each of the remaining $N$ lines contains four integers $x_1, y_1, x_2, y_2$ describing a rectangular region being painted, with lower-left corner $(x_1, y_1)$ and upper-right corner $(x_2, y_2)$. All $x$ and $y$ values are in the range $0 \ldots 200$, and all rectangles have positive area.Like the rectangles he already painted, any new rectangles that Farmer John paints must have positive area, and their corner points must have $x$ and $y$ coordinates in the range $0 \ldots 200$.

#### OUTPUT FORMAT (file paintbarn.out):

Please output the maximum area of the barn that could be covered by exactly $K$ coats of paint, if Farmer John paints up to two additional disjoint rectangles.#### SAMPLE INPUT:

3 2 1 1 4 4 3 3 7 6 2 2 8 7

#### SAMPLE OUTPUT:

26

Problem credits: Nick Wu and Brian Dean