CF459C.Pashmak and Buses

Recently Pashmak has been employed in a transportation company. The company has k buses and has a contract with a school which has n students. The school planned to take the students to d different places for d days (each day in one place). Each day the company provides all the buses for the trip. Pashmak has to arrange the students in the buses. He wants to arrange the students in a way that no two students become close friends. In his ridiculous idea, two students will become close friends if and only if they are in the same buses for all d days.

Please help Pashmak with his weird idea. Assume that each bus has an unlimited capacity.

最近，帕什马克受雇于一家运输公司。该公司拥有 $k$ 辆巴士，并与一所拥有 $n$ 名学生的学校签订了合同。学校计划在 $d$ 天内带领学生前往 $d$ 个不同的地点（每天去一个地点）。每天，公司都会为此次行程提供全部 $k$ 辆巴士。帕什马克需要将学生安排到各辆巴士中。他希望以某种方式安排学生，使得任意两名学生都不会成为亲密朋友。在他荒谬的想法中，当且仅当两名学生在全部 $d$ 天里都乘坐同一辆巴士时，他们才会成为亲密朋友。

请帮助帕什马克实现他这个古怪的想法。假设每辆巴士的容量是无限的。

The first line of input contains three space-separated integers n, k, d (1 ≤ n, d ≤ 1000; 1 ≤ k ≤ 109).

输入的第一行包含三个以空格分隔的整数 $n$、$k$、$d$（$1 \le n, d \le 1000$；$1 \le k \le 10^9$）。

If there is no valid arrangement just print -1. Otherwise print d lines, in each of them print n integers. The j-th integer of the i-th line shows which bus the j-th student has to take on the i-th day. You can assume that the buses are numbered from 1 to k.

如果不存在合法的安排方案，则输出 -1。否则输出 d 行，每行包含 n 个整数。其中第 i 行的第 j 个整数表示第 j 个学生在第 i 天需要乘坐的公交车编号。你可以假设公交车编号为 1 到 k。

Note that two students become close friends only if they share a bus each day. But the bus they share can differ from day to day.

注意，两名学生只有在每天共乘同一辆校车时才会成为亲密朋友。但他们每天共乘的校车可以不同。