#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define minim(x,y) (x<y?x:y) #define maxim(x,y) (x>y?x:y) const int Nmax=100005; const int N=1005; using namespace std; int n,i,m,j,ii,jj,b[3004][3004],x,nr; int main() { #ifndef ONLINE_JUDGE freopen("a.in","r",stdin); freopen("a.out","w",stdout); #endif scanf("%d%d%d",&n,&m,&x); for(i=1;i<=n;++i) for(j=1;j<=m;++j) { scanf("%d",&nr); for(ii=1;ii<=x;++ii) for(jj=1;jj<=x;++jj) b[i*x-x+ii][j*x-x+jj]=nr; } for(i=1;i<=n*x;++i) {for(j=1;j<m*x;++j) printf("%d ",b[i][j]); printf("%d\n",b[i][j]); } return 0; }