#include"bits/stdc++.h"
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
#define all(a)a.begin(),a.end()
#define rall(a)a.rbegin(),a.rend()
#define rep(i,n)for(int i=0;i<(n);++i)
#define YN(ans)cout<<(ans?"Yes\n":"No\n")
#define uni(a)sort(all(a)),a.erase(unique(all(a)),a.end())
#define pv(a)cerr<<#a<<':';for(auto e:a)cerr<<' '<<e;cerr<<'\n'
#define pvv(a)cerr<<#a<<':';for(auto e:a){cerr<<'\n';for(auto e2:e)cerr<<' '<<e2;}cerr<<'\n'
#define mine(a)*ranges::min_element(a)
#define maxe(a)*ranges::max_element(a)
#define sume(a)accumulate(all(a),0LL)
template<class T>bool chmin(T&a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
constexpr int inf=2e9,dx4[4]={0,-1,0,1},dy4[4]={1,0,-1,0},dx8[8]={0,-1,-1,-1,0,1,1,1},dy8[8]={1,1,0,-1,-1,-1,0,1};
constexpr ll INF=2e18;

int main(){
    cin.tie(0)->sync_with_stdio(0),cout<<fixed<<setprecision(0);
    ll N,M,K;cin>>N>>M>>K;
    if(M>K*K)cout<<"-1\n",exit(0);
    vector<ll>cnt2(M);
    vector v1(N,vector<ll>(N)),v2(N,vector<ll>(N)),cnt(K,vector<ll>(K)),v(K,vector<ll>(K,-1)),ans(N,vector<ll>(N,-1));
    rep(i,N){
        rep(j,N)v1[i][j]=i%K;
        if(i/K%2==0)rep(j,N)v2[i][j]=j%K;
        else rep(j,N)v2[i][j]=K-j%K-1;
        rep(j,N)++cnt[v1[i][j]][v2[i][j]];
    }vector<tuple<ll,ll,ll>>vt(K*K);
    rep(i,K)rep(j,K)vt[i*K+j]={cnt[i][j],i,j};
    sort(all(vt));
    rep(i,M){
        auto[_,x,y]=vt[i];
        v[x][y]=i;
    }rep(i,N)rep(j,N){
        ll val=v[i%K][j%K];
        if(val!=-1)ans[i][j]=val,++cnt2[val];
    }rep(i,M)if(cnt2[i]>N*N/M)cout<<"-1\n",exit(0);
    rep(i,N){
        rep(j,N){
            if(ans[i][j]==-1)rep(k,M)if(cnt2[k]+1<=N*N/M){
                ans[i][j]=k,++cnt2[k];
                break;
            }cout<<ans[i][j]+1<<' ';
        }cout<<'\n';
    }
}