#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i += 6) {
    if (n % i == 0 || n % (i + 2) == 0) return false;
  }
  return true;
}
long long modexp(long long a, long long b, long long m) {
  long long r = 1;
  a = a % m;
  while (b > 0) {
    if (b & 1) r = (r * a) % m;
    b = b >> 1;
    a = (a * a) % m;
  }
  return r % m;
}
struct CustomCompare {
  bool operator()(const int& lhs, const int& rhs) { return lhs < rhs; }
};
long long builtin_popcount(long long x) {
  long long cnt = 0;
  for (long long i = 60; i >= 0; i--) {
    if ((1LL << i) & x) cnt++;
  }
  return cnt;
}
long long addmod(long long a, long long b, long long r) {
  a %= r;
  b %= r;
  return (a + b) % r;
}
long long mulmod(long long a, long long b, long long r) {
  a %= r;
  b %= r;
  return (a * b) % r;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k, d;
  cin >> n >> k >> d;
  long long res = 1;
  bool flag = false;
  for (int i = 0; i < d; i++) {
    res *= k;
    if (res >= n) {
      flag = true;
      break;
    }
  }
  if (!flag || (d == 1 && n > k)) {
    cout << -1 << endl;
    return 0;
  }
  int ans[d][n];
  memset(ans, 0, sizeof(ans));
  for (int i = 0; i < n; i++) {
    long long bit = i, j = 0;
    while (bit > 0) {
      ans[j++][i] = bit % k;
      bit /= k;
    }
  }
  for (int i = 0; i < d; i++) {
    for (int j = 0; j < n; j++) cout << ans[i][j] + 1 << " ";
    cout << endl;
  }
  return 0;
}
