#include<stdio.h>
#include<algorithm>
#define maxn 105
#define maxnx 2005
using namespace std;

int n,m,X;
int a[maxn][maxn];
int b[maxnx][maxnx];

void read()
{
    scanf("%d %d %d",&n,&m,&X);
    for(int i=1;i<=n;i++)
     for(int j=1;j<=m;j++)
       scanf("%d ",&a[i][j]);
}

void complete(int x,int y,int val)
{
    for(int i=x;i<=x+X-1;i++)
     for(int j=y;j<=y+X-1;j++)
      b[i][j]=val;
}

void solve()
{
    for(int i=1;i<=n;i++)
     for(int j=1;j<=m;j++)
         complete((i-1)*X+1,(j-1)*X+1,a[i][j]);

    for(int i=1;i<=n*X;i++)
    {
        for(int j=1;j<=m*X;j++)
         printf("%d ",b[i][j]);
        printf("\n");
    }
}

int main()
{
    //freopen("date.in","r",stdin);
    //freopen("date.out","w",stdout);

    read();
    solve();

    return 0;
}