#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = (1LL << 62) - (1LL << 31) - 1;

#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define RREP(i, init, n) for(int i = (int)(init); i >= (int)(n); i--)
#define All(A) A.begin(), A.end()
#define rAll(A) A.rbegin(), A.rend()

#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>

#define DEF_VER(T, A) T A; cin >> A;
#define DEF_VEC(T, A, N) A.resize(N); REP(i, 0, N) cin >> A[i];
#define DEF_VEC_VEC(T, A, N, M) A.resize(N, vector<T>(M)) REP(i, 0, N) REP(j, 0, M) cin >> A[i][j];

int N, M, K;

void solve() {
    vvi ans(N, vi(N, 0));
    REP(i, 0, N) {
        REP(j, 0, N) {
            if(j < K) {
                int num = (i * K + j) % M + 1;
                ans[i][j] = num;
            } else {
                ans[i][j] = ans[i][j - K];
            }
        }
    }

    REP(i, 0, N) {
        REP(j, 0, N) {
            cout << ans[i][j] << " ";
        }
        cout << endl;
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    cin >> N >> M >> K;
    solve();
}