#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    int q = n/m;
    
    if (m > k*k) {
        puts("-1");
        return 0;
    }
    
    vector b(m, vector<int>(m));
    rep(i, m)rep(j, m) b[i][j] = (i+j)%m+1;
    
    vector a(n, vector<int>(n));
    rep(bi, m)rep(bj, m) {
        int x = b[bi][bj];
        rep(di, q)rep(dj, q) {
            int i = bi*q+di;
            int j = bj*q+dj;
            a[i][j] = x;
        }
    }

    rep(i, n)rep(j, n) cout << a[i][j] << " \n"[j == n-1];
    
    return 0;
}