#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vvvl=vector<vvl>;
using graph=vector<vector<int>>;
using mint=modint998244353;
const ll INF=(1ll<<61)-1;

int main(){
  ll N,M,K; cin>>N>>M>>K;
  vvl cnt(K,vl(K,0));
  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      cnt[i%K][j%K]++;
    }
  }
  ll a=1;
  vvl ans(N,vl(N,-1));
  queue<ll> que;
  for(int i=0;i<K;i++){
    for(int j=0;j<K;j++){
      if(cnt[i][j]<=N*N/M){
        for(int k=i;k<N;k+=K){
          for(int l=j;l<N;l+=K)ans[k][l]=a;
        }
        for(int k=0;k<N*N/M-cnt[i][j];k++)que.push(a);
        if(a==M){
          for(int k=0;k<N;k++){
            for(int l=0;l<N;l++){
              if(ans[k][l]==-1){
                ans[k][l]=que.front();
                que.pop();
              }
              cout<<ans[k][l]<<" ";
            }
            cout<<endl;
          }
          return 0;
        }
        a++;
      }
    }
  }
  cout<<-1<<endl;
  return 0;
}