Hyper-minimum

There is a 4-dimensional array $X$ whose index along every dimension runs from 1 to $N$. Build the 4-dimensional array $Y$ defined by

$Y[i_1, i_2, i_3, i_4] = \min X[j_1, j_2, j_3, j_4]$

where the minimum is taken over every $(j_1, j_2, j_3, j_4)$ with $1 \le i_k \le N - M + 1$ and $i_k \le j_k \le i_k + M - 1$ for each $k$. In other words, one element of $Y$ is the minimum of the values inside a 4-dimensional cube of side $M$ in $X$. Every dimension of $Y$ has size $N - M + 1$.

The first line contains $N$ and $M$ ($1 \le M \le N$). The following lines contain the elements of $X$. The number of elements $N^4$ is at most 1500000, and each element is an integer whose absolute value is at most $10^9$. The elements are given in the order that this pseudocode reads them.

for i = 1 to N:
    for j = 1 to N:
        for k = 1 to N:
            for l = 1 to N:
                read X[i, j, k, l]

Print the $(N - M + 1)^4$ elements of $Y$ in the same order as $X$, that is, in the order of the same four nested loops. Print all values on one line, separated by single spaces.