Description

Translated from ROIR 2021 Day2 T3 Хорошие раскраски on this website.

Your task is to find a solution of the follows:

Use $c$ kinds of colors to colorize a matrix of size $n\times m$ satisfying that for any $1\le x_1<x_2\le n,~1\le y_1<y_2\le m$, the color in cells $(x_1,y_1)$, $(x_2,y_1)$, $(x_1,y_2)$, $(x_2,y_2)$ are different.

It is guaranteed that a solution exists.

Input Format

Three integers $n,~m,~c$ in the only line.

Output Format

Output $n$ lines and $m$ columns of numbers, each representing the color of corresponding cells.

2 2 2

1 2
2 2

Constraints

• For $25\%$ of test data, it is guaranteed that $c=2$.
• For the other $75\%$ of test data, it is guaranteed that $c=3$.
• For all test data, it is guaranteed that $2\le n,m\le 10,~ 2\le c\le 3$.