#include <bits/stdc++.h>
using namespace std;
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, d;
long long k, now;
int a[1005][1005];
void Dfs(int u, int i) {
  if (a[u][i] == k) {
    a[u][i] = 0;
    a[u][i + 1]++;
    Dfs(u, i + 1);
  }
}
int main() {
  n = read();
  k = read();
  d = read();
  int t = n;
  for (int i = 1; i <= d; i++) t = t / k + (int)(t % k > 0);
  memset(a, 0, sizeof(a));
  if (t == 1) {
    for (int u = 2; u <= n; u++) {
      for (int i = 1; i <= d; i++) a[u][i] = a[u - 1][i];
      a[u][1] += 1;
      Dfs(u, 1);
    }
    for (int i = 1; i <= d; i++) {
      for (int j = 1; j <= n; j++) printf("%d ", a[j][i] + 1);
      puts("");
    }
  } else
    puts("-1");
  return 0;
}
