You have a grid with $H$ rows from top to bottom and $W$ columns from left to right. We denote by $(i, j)$ the square at the $i$\-th row from the top and $j$\-th column from the left. $(i,j)\ (1\leq i\leq H,1\leq j\leq W)$ has an integer $A _ {i,j}$ between $1$ and $N$ written on it. You are given integers $h$ and $w$. For all pairs $(k,l)$ such that $0\leq k\leq H-h$ and $0\leq l\leq W-w$, solve the following problem: - If you black out the squares $(i,j)$ such that $k\lt i\leq k+h$ and $l\lt j\leq l+w$, how many distinct integers are written on the squares that are not blacked out? Note, however, that you do not actually black out the squares (that is, the problems are independent).

The input is given from Standard Input in the following format: >$H$ $W$ $N$ $h$ $w$\ >$A _ {1,1}$ $A _ {1,2}$ $\dots$ $A _ {1,W}$\ >$A _ {2,1}$ $A _ {2,2}$ $\dots$ $A _ {2,W}$\ >$\vdots$\ >$A _ {H,1}$ $A _ {H,2}$ $\dots$ $A _ {H,W}$ #### Constraints - $1 \leq H,W,N \leq 300$ - $1 \leq h \leq H$ - $1 \leq w \leq W$ - $(h,w)\neq(H,W)$ - $1 \leq A _ {i,j} \leq N\ (1\leq i\leq H,1\leq j\leq W)$ - All values in the input are integers.

Print the answers in the following format, where $\operatorname{ans}_{k,l}$ denotes the answer to $(k, l)$: >$\operatorname{ans} _ {0,0}$ $\operatorname{ans} _ {0,1}$ $\dots$ $\operatorname{ans} _ {0,W-w}$\ >$\operatorname{ans} _ {1,0}$ $\operatorname{ans} _ {1,1}$ $\dots$ $\operatorname{ans} _ {1,W-w}$\ >$\vdots$\ >$\operatorname{ans} _ {H-h,0}$ $\operatorname{ans} _ {H-h,1}$ $\dots$ $\operatorname{ans} _ {H-h,W-w}$

***For Sample #1:*** The given grid is as follows:  For example, when $(k,l)=(0,0)$, four distinct integers $1,3,4$, and $5$ are written on the squares that are not blacked out, so $4$ is the answer.

AtCoder [ABC278E]