#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define ppb pop_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep_select(_1, _2, _3, name, ...) name
#define rep(...) rep_select(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rrep2(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i)
#define rrep3(i, a, b) for (ll i = (ll)(b) - 1; i >= (ll)(a); --i)
#define rrep(...) rep_select(__VA_ARGS__, rrep3, rrep2)(__VA_ARGS__)

int main() {
  ll n,m,k;
  cin >> n >> m >> k;

  vvl ans(n,vl(n,-1));
  vl cnt(m,n*n/m);

  for(ll i=0;i<n;i+=k){
    for(ll j=0;j<n;j+=k){
      for(ll ii=i;ii<min(n,i+k);ii++){
        for(ll jj=j;jj<min(n,j+k);jj++){

          
          ll num=(ii-i)*k+(jj-j);
          //cout << i << j << ii << jj << endl;
          if(num>=m) continue;
          ans[ii][jj]=num;
          cnt[num]--;
        }
      }
    }
  }

  queue<ll> que;
  rep(i,m){
    rep(j,cnt[i]){
      que.push(i);
    }
  }
  rep(i,n)rep(j,n){
    if(ans[i][j]==-1){
      ans[i][j]=que.front();
      que.pop();
    }
  }

  rep(i,n){
    rep(j,n){
      cout << ans[i][j]+1 << " ";
    }
    cout << endl;
  }

}