// RandomUsername (Nikola Jovanovic)
// MindCoding 2016
// Round 1
// A

#include <bits/stdc++.h>
#define DBG false
#define debug(x) if(DBG) printf("(ln %d) %s = %d\n", __LINE__, #x, x);
#define lld long long
#define ff(i,a,b) for(int i=a; i<=b; i++)
#define fb(i,a,b) for(int i=a; i>=b; i--)
#define par pair<int, int>
#define fi first
#define se second
#define mid (l+r)/2
#define INF 1000000000
#define MAXN 1005

using namespace std;

int a[MAXN][MAXN];
int x, n, m;
int b[MAXN][MAXN];

int main()
{
    scanf("%d %d %d", &n, &m, &x);
    ff(i, 0, n-1)
    {
        ff(j, 0, m-1)
        {
            scanf("%d", &a[i][j]);
        }
    }
    ff(i, 0, x*n-1)
    {
        ff(j, 0, x*m-1)
        {
            printf("%d ", a[i/x][j/x]);
        }
        printf("\n");
    }
    return 0;
}