##### IOI '99 - Antalya-Belek, Turkey

The residents of Dingilville are trying to locate a region to build an airport. The map of the land is at hand. The map is a rectangular grid of unit squares, each identified by a pair of coordinates , where is the horizontal (west-east) and is the vertical (south-north) coordinate. The height of every square is shown on the map.

Your task is to find a rectangular region of squares with the largest area (i.e. a rectangular region consisting of the largest number of squares) such that

- the height difference between the highest and the lowest squares of the region is less than or equal to a given limit , and
- the width (i.e. the number of squares along the west-east direction) of the region is at most .

In case there is more than one such region you are required to report only one of them.

#### Input Specification

The first line contains three integers: the number of squares in the
east-west direction, , the number of squares in
the north-south direction, , and
.

Each of the following lines contains the integers
for . More specifically,
occurs as the number on the
input line.

#### Output Specification

The output should consist of a single line containing four space-separated integers describing the region found: , , , where are the coordinates of the southwest corner square, and are the coordinates of the northeast corner square of the region.

#### Sample Input

```
10 15 4
41 40 41 38 39 39 40 42 40 40
39 40 43 40 36 37 35 39 42 42
44 41 39 40 38 40 41 38 35 37
38 38 33 39 36 37 32 36 38 40
39 40 39 39 39 40 40 41 43 41
39 40 41 38 39 38 39 39 39 42
36 39 39 39 39 40 39 41 40 41
31 37 36 41 41 40 39 41 40 40
40 40 40 42 41 40 39 39 39 39
42 40 44 40 38 40 39 39 37 41
41 41 40 39 39 40 41 40 39 40
47 45 49 43 43 41 41 40 39 42
42 41 41 39 40 39 42 40 42 42
41 44 49 43 46 41 42 41 42 42
45 40 42 42 46 42 44 40 42 41
```

#### Sample Output

`4 5 8 11`

Note: the bolded region in the input map corresponds to the region indicated in the output.

## Comments