Connected Coloring

There is an $N \times M$ grid. Let $(r,c)$ denote the cell in the $r$-th row from the top and the $c$-th column from the left.

Two cells are adjacent if they share a side. Equivalently, $(r,c)$ and $(r',c')$ are adjacent if and only if $\mathrm{\mid }r-{}^{}$.

Color every cell with one of the colors $1,2,\cdots,K$. The coloring must satisfy all of the following conditions.

• For every $i$ ($1 \le i \le K$), exactly $A_i$ cells have color $i$.

For every input satisfying the constraints, it can be proved that at least one such coloring exists. Find any coloring satisfying the conditions.

The input is given from Standard Input in the following format:

$N\ M\ K$ $A_1\ A_2\ \cdots\ A_K$

Print the coloring in $N$ lines. On the $r$-th line, print $M$ space-separated integers $C_{r,1},C_{r,2},\cdots,C_{r,M}$, where is the color of cell .

• $1 \le N,M \le 200\,000$.
• $NM \le 200\,000$.
• $1\le K\le$.