Kenjiro is a fisherman who collects fish from the lake. The entire lake is rectangular in shape. The lake is lined with a grid of square-shaped administrative blocks. On the map, the coordinates of the upper-left control area of the lake are (1,1), and the coordinates of the i-th control area from the top and j-th control area from the left are (i,j). From our previous experience, we know that there is one fish in every management compartment and the price of each fish.
Fishing is done by setting up a rectangular net and enclosing some of the management plots with the net. Any fish in the netted management plots can be obtained. However, it was decided to introduce rules to protect the growth of fish and fishermen will have to abide by these rules when fishing. We don't know the details of the rule yet, but we do know that the rule will be based on the price of the fish that is the $K$th from the cheapest when the fish obtained in a single net placement are listed in order of price.
Kenjirou decided to find out the price of the $K$th fish from the cheapest one for all the places where nets could be set so that he could comply with the rule and start fishing as soon as possible.
Given the price of the fish in each section of the lake, the size of the net surrounding the control section, and the location $K$ where the price of the fish is to be checked, create a program that displays the price of the fish located $K$th from the cheapest for all locations where the net can be placed. However, the net will not rotate or deform.
Input is given in the following format.
$H$ $W$ $R$ $C$
$K$
$a_{1,1}$ $a_{1,2}$ ... $a_{1,W}$
$a_{2,1}$ $a_{2,2}$ ... $a_{2,W}$
：
$a_{H,1}$ $a_{H,2}$ ... $a_{H,W}$
In the first line, we are given the number of vertical plots in the lake, $H$ ($1\leq H \leq 400$), the number of horizontal plots, $W$ ($1\leq W \leq 400$), the number of vertical plots in the net surrounding the management plot, $R$ ($1\leq R \leq H$), and the number of horizontal plots, $C$ ($1\leq C \leq W $) are given. In the following line, the position $K$ ($1 \leq K \leq R \times C$) for examining the price is given. In the subsequent $H$ line, the price $a_{i,j}$ ($0 \leq a_{i,j} \leq 1,000,000,000$) of the fish in the plot at coordinates (i,j) is given.
The output is $(H-R+1)\times(W-C+1)$ lines, one per line, in ascending order, with the fish prices obtained for each location where the net can be set.
3 3 2 2 3 5 7 9 8 9 2 3 2 1
2 8 8 9
The third from the cheapest of prices 5, 7, 8, and 9 for the fish in the section where the upper left is (1,1) and the lower right is (2,2) is 8.
The third price from the lowest of 7,9,9,2 is 9 for the fish in the section where the top left is (1,2) and the bottom right is (2,3).
The third price from the lowest of 8,9,3,2 is 8 for the fish in the section where the top left is (2,1) and the bottom right is (3,2).
The third price from the lowest of 9,2,2,1 is 2 for the fish in the section where the top left is (2,2) and the bottom right is (3,3).