#include<bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using lll = __int128;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,ll>;
using vp=vector<pair<ll, ll>>;
using ld = long double;
//using mint=modint1000000007;
//using mint=modint998244353;

const ll INF=1ll<<60;
ll mod10=1e9+7;
ll mod99=998244353;
const double PI = acos(-1);

#define rep(i,n) for (ll i=0;i<n;++i)
#define per(i,n) for(ll i=(n)-1;i>=0;--i)
#define rep2(i,a,n) for (ll i=a;i<n;++i)
#define per2(i,a,n) for (ll i=a;i>=n;--i)

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }

bool solve(){
    ll N,M,K;cin>>N>>M>>K;
    if(K*K<M){
        cout << -1 << endl;
        return 0;
    }
    vvll ans(N,vll(N,-1));
    ll now=0;
    rep(i,K) rep(j,K){
        if(now==M) break;
        ans[i][j]=now++;
    }
    
    for(int i=0;i<N;i+=K) for(int j=0;j<N;j+=K){
        if(i==0&&j==0) continue;
        rep(pi,K) rep(pj,K) if(i+pi<N&&j+pj<N) ans[i+pi][j+pj]=ans[(i+pi)%K][(j+pj)%K];
    }

    vll Cnt(M,N*N/M);rep(i,N) rep(j,N) if(ans[i][j]>=0) Cnt[ans[i][j]]--;
    rep(i,M) if(Cnt[i]<0){
        cout << -1 << endl;
        return 0;
    }
    now=0;
    rep(i,N) rep(j,N){
        if(ans[i][j]!=-1) continue;
        while(Cnt[now]==0) now++;
        ans[i][j]=now;
        Cnt[now]--;
    }



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




int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll T=1;//cin>>T;
    rep(i,T) while(solve());
}