Background

Translated from ROIR 2021 Day2 T3 Хорошие раскраски。

Problem Description

Color an $n\times m$ matrix using $c$ colors. It is required that for any $1\le x_1<x_2\le n$ and $1\le y_1<y_2\le m$, the colors of the four cells $(x_1,y_1)$, $(x_2,y_1)$, $(x_1,y_2)$, $(x_2,y_2)$ are not all different.

Construct one valid coloring.

The testdata guarantees that a solution exists.

Input Format

One line with three integers $n,m,c$.

Output Format

Output $n$ lines. Each line contains $m$ integers in the range $1\sim c$, representing the color used for each cell.

2 2 2

1 2
2 2

Hint

• For $25\%$ of the testdata, $c=2$。
• For the other $75\%$ of the testdata, $c=3$。
• For $100\%$ of the testdata, $2\le n,m\le 10$ and $2\le c\le 3$。

Note: The attachment is the Special Judge for this problem, for debugging.

Translated by ChatGPT 5