#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) { return n | (1LL << i); }
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007;
  b %= 1000000007;
  normal(a);
  normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007;
  b %= 1000000007;
  normal(a);
  normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007;
  b %= 1000000007;
  normal(a);
  normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1LL;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, k, d;
  cin >> n >> k >> d;
  long long p = 1LL;
  bool ok = 0;
  for (int i = 1; i <= d; ++i) {
    p *= (long long)k;
    if (n <= p) {
      ok = 1;
      break;
    }
  }
  if (!ok) {
    cout << "-1" << '\n';
    return 0;
  }
  long long ans[n][d];
  for (int i = 0; i < d; ++i) ans[0][i] = 0;
  for (int i = 1; i < n; ++i) {
    for (int j = 0; j < d; ++j) ans[i][j] = ans[i - 1][j];
    for (int j = d - 1; j >= 0; --j) {
      ans[i][j] = (ans[i][j] + 1) % k;
      if (ans[i][j]) break;
    }
  }
  for (int i = 0; i < d; ++i) {
    for (int j = 0; j < n; ++j) {
      if (j != 0) cout << " ";
      cout << ans[j][i] + 1;
    }
    cout << '\n';
  }
  return 0;
}
