#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
using namespace std;

const int N = 5000;
int s[N][N], s1[N][N];

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
        scanf("%d", &s[i][j]);
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            int i1 = i*k, i2 = i1 + k;
            int j1 = j*k, j2 = j1 + k;
            for(int ii = i1; ii < i2; ++ii)
                for(int jj = j1; jj < j2; ++jj)
                    s1[ii][jj] = s[i][j];
        }
    }
    for(int i = 0; i < k*n; ++i) {
        for(int j = 0; j < k*m; ++j) {
            printf("%d ", s1[i][j]);
        }
        cout << endl;
    }
    
    return 0;
}