#include<bits/stdc++.h>
#define cin fin
#define cout fout
#define endl '\n'
using namespace std;
const int maxn = 300;
int a[maxn+3][maxn+3],tek[maxn+3][maxn+3];
int ans[10],cnt[10],ind[10],wins[10];
int tables[maxn+3][maxn+3];
int otg[10][maxn+3][maxn+3];
char c;
int i,j,p,q,n,m,k,d,parties,pos,br;
//ifstream fin("test.txt");
ifstream fin("gerrymandering.in");
ofstream fout("gerrymandering.out");
void read()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>d>>parties;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            cin>>a[i][j];
            //a[i][j]=c-'0';
        }
    }

}
void wrrite(int ind)
{
    for(int ii=1; ii<=n; ii++)
        for(int jj=1; jj<=n; jj++)
            otg[ind][ii][jj]=tables[ii][jj];
}
void build(int lrow,int lcol,int rrow,int rcol,int p,int q)
{
    int lc = lcol;
    while(lrow<=rrow)
    {
        br++;
        ///vzimame podtablica ot l,r - razmeri p,q
        for(int x=lrow; x<lrow+p; x++)
        {
            for(int y=lc; y<lc+q; y++)
            {
                tables[x][y]=br;
                cnt[a[x][y]]++;
            }
        }

        ///cnt
        int maxx=0;
        int which = -1;
        for(int jjj=1; jjj<=parties; jjj++)
        {
            if(cnt[jjj]>maxx)
                maxx=cnt[jjj],which=jjj;
            else if(cnt[jjj]==maxx)
                which=-1;
            cnt[jjj]=0;
        }
        if(which!=-1)
            wins[which]++;
        lc+=q;
        if(lc>rcol)
            lrow+=p,lc=lcol;

    }
}
void prrint()
{
    for(int ii=1; ii<=n; ii++)
    {
        for(int jj=1; jj<=n; jj++)
            cout<<tables[ii][jj]<<" ";
        cout<<endl;
    }
}
void check_winners()
{
    for(int jjj=1; jjj<=parties; jjj++)
    {
        //cout<<"party "<<j<<" won "<<wins[j]<<" times "<<endl;
        if(wins[jjj]>ans[jjj] || otg[jjj][1][1]==0)
            ans[jjj]=wins[jjj],wrrite(jjj);
        wins[jjj]=0;
    }
}
void construct_tables()
{
    k = (n*n)/d;
    vector <int> del;
    for(i=1; i<=sqrt(k); i++)
        if(k%i==0)del.push_back(i),del.push_back(k/i);

    p=sqrt(k);
    if(k%p==0 && k/p==p)
        del.pop_back();

    for(auto i:del)
    {
        p=i;
        q=k/i;
        if(n%p!=0 || n%q!=0)
            continue;
        // cout<<"dimensions "<<p<<" "<<q<<endl;
        int l=1,r=1;
        br=0;

        ///build
        build(l,r,n,n,p,q);

        ///wins

        check_winners();

    }

    ///da zapulva po kolonata
    for(int i=0; i<del.size(); i++)
    {
        p = del[i];
        if(p>=n)continue;
        q = k/del[i];
        if(n%q!=0)continue;
        for(int j=0; j<del.size(); j++)
        {
            if(i==j)continue;
            int p2=del[j];
            if(p2>=n)continue;
            int q2=k/del[j];
            if(n%q2!=0)
                continue;
            int cnttt=0;
            for(int g=1; g<=n/p; g++)
            {
               // cout<<n<<" "<<g*p<<" "<<p2<<endl;
                if((n-g*p)%p2!=0 || n-g*p==0)continue;///vtoroto uslovie moje da se mahne
                cnttt++;

                ///g*p reda she sa s purvata
                ///(n-g*p)/p2 reda she sa s vtorata
                br=0;
                //cout<<"dimensions "<<p<<" "<<q<<" "<<p2<<" "<<q2<<endl;
                build(1,1,g*p,n,p,q);
                build(g*p+1,1,n,n,p2,q2);
                //prrint();
                check_winners();
                //if(cnttt==5)break;
            }
        }
    }


    ///da zapulva po reda
    for(int i=0; i<del.size(); i++)
    {
        p = del[i];
        if(n%p!=0)continue;
        q = k/del[i];
        if(q>n)continue;
        for(int j=0; j<del.size(); j++)
        {
            if(i==j)continue;
            int p2=del[j];
            if(n%p2!=0)continue;
            int q2=k/del[j];
            if(q2>n)
                continue;
            for(int g=1; g<=n/q; g++)
            {
               // cout<<n<<" "<<g*p<<" "<<p2<<endl;
                if((n-g*q)%q2!=0 || n-g*q==0)continue;///vtoroto uslovie moje da se mahne

                ///g*q koloni she sa s purvata
                ///(n-g*q)/q2 koloni she sa s vtorata
                br=0;
                //cout<<"dimensions "<<p<<" "<<q<<" "<<p2<<" "<<q2<<endl;
                build(1,1,n,g*q,p,q);
                build(1,g*q+1,n,n,p2,q2);
                //prrint();
                check_winners();
                //if(cnttt==5)break;
            }
        }
    }
    ///za zapulva reda

}
void print()
{

    for(i=1; i<=parties; i++)
    {
        //cout<<ans[i]<<endl;
        for(j=1; j<=n; j++)
        {
            for(k=1; k<=n; k++)
            {
                cout<<otg[i][j][k]<<" ";
            }
            cout<<endl;
        }
        //cout<<endl;
    }


}

int main()
{
    read();
    construct_tables();
    print();
    return 0;
}
/**
5 5 2
2 2 2 2 2
2 2 2 2 2
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1

6 6 3
1 2 2 1 1 2
3 1 1 2 3 1
1 3 1 1 3 2
2 1 1 1 2 1
2 1 2 3 3 2
3 2 1 2 1 3
*/