Rectangles

문제

In the early 19th century, the ruler Hoseyngulu Khan Sardar ordered a palace to be built on a plateau overseeing a beautiful river. The plateau is modeled as an $n\times mn\; \backslash times\; m$ grid of square cells. The rows of the grid are numbered $00$ through $n-1n-1$, and the columns are numbered $00$ through $m-1m-1$. We refer to the cell in row $ii$ and column $jj$ ($0\le i\le n-1,0\le j\le m-10\; \backslash leq\; i\; \backslash leq\; n-1,\; 0\; \backslash leq\; j\; \backslash leq\; m-1$) as cell $(i,j)(i,j)$. Each cell $(i,j)(i,j)$ has a specific height, denoted by $a[i][j]a[i][j]$.

Hoseyngulu Khan Sardar asked his architects to choose a rectangular area to build the palace. The area should not contain any cell from the grid boundaries (row $00$, row $n-1n-1$, column $00$, and column $m-1m-1$). Hence, the architects should choose four integers $r_{1}r\_1$, $r_{2}r\_2$, $c_{1}c\_1$, and $c_{2}c\_2$ ($1\le r_1\le r_2\le n-21\; \backslash leq\; r\_1\; \backslash leq\; r\_2\; \backslash leq\; n-2$ and $1\le c_1\le c_2\le m-21\; \backslash leq\; c\_1\; \backslash leq\; c\_2\; \backslash leq\; m-2$), which define an area consisting of all cells $(i,j)(i,\; j)$ such that $r_1\le i\le r_{2}r\_1\; \backslash leq\; i\; \backslash leq\; r\_2$ and $c_1\le j\le c_{2}c\_1\; \backslash leq\; j\; \backslash leq\; c\_2$.

In addition, an area is considered valid, if and only if for every cell $(i,j)(i,\; j)$ in the area, the following condition holds:

• Consider the two cells adjacent to the area in row $ii$ (cell $(i,c_1-1)(i,\; c\_1-1)$ and cell $(i,c_2+1)(i,\; c\_2+1)$) and the two cells adjacent to the area in column $jj$ (cell $(r_1-1,j)(r\_1-1,\; j)$ and cell $(r_2+1,j)(r\_2+1,\; j)$).

The height of cell $(i,j)(i,j)$ should be strictly smaller than the heights of all these four cells.

Your task is to help the architects find the number of valid areas for the palace (i.e., the number of choices of $r_{1}r\_1$, $r_{2}r\_2$, $c_{1}c\_1$ and $c_{2}c\_2$ that define a valid area).