CF291D.Parallel Programming

The first line contains two space-separated integers $n$ and $k$ $(1<=n<=10^{4},1<=k<=20)$ .

It is guaranteed that at the given $n$ and $k$ the required sequence of operations exists.

Print exactly $n·k$ integers in $k$ lines. In the first line print numbers $c_{1},c_{2},...,c_{n}$ $(1<=c_{i}<=n)$ for the first increment operation. In the second line print the numbers for the second increment operation. In the $k$ -th line print the numbers for the $k$ -th increment operation.

As a result of the printed operations for any $i$ value $a_{i}$ must equal $n-i$ .

无