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

#define rep(i,n) for (int i=0; i<(n); ++i)
#define nall(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl

template<typename T,typename U>inline bool chmax(T&a,U b){if(a<b){a=b;return 1;}return 0;}
template<typename T,typename U>inline bool chmin(T&a,U b){if(a>b){a=b;return 1;}return 0;}

using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;

const int inf = (1e9);
const ll INF = (1e18)+(1e9);
const ll dx[] = {0,1,0,-1,1,1,-1,-1};
const ll dy[] = {1,0,-1,0,1,-1,1,-1};

//#include <atcoder/all>
//using namespace atcoder;

//using mint = modint998244353;

int testcase(){
    ll n,m,k; cin >> n >> m >> k;
    ll s = 1;
    for(ll i=1; i<=n; i++){
        for(ll j=s; j<n+s; j++){
            if(j%m) cout << j%m << ' ';
            else cout << m << ' ';
        }
        cout << endl;
        s+=k;
        s%=n;
    }
    return 0;
}

int main(){
    ios::sync_with_stdio(false); 
    cin.tie(nullptr);

    //int t=1;
    //cin >> t;
    //while(t--)
    testcase();

    return 0;
}