//Code by Patcas Csaba

#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REPEAT do{ 
#define UNTIL(x) }while(!(x)); 

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()

#define IN_FILE "a.in"
#define OUT_FILE "a.out"

int n, m, x;
VVI a, b;

int main()
{
	//Read data
	

	//Solve
  cin >> n >> m >> x;
  a.RS(n + 1, VI(m + 1));
  b.RS(n * x + 1, VI(m * x + 1));

  FOR(i, 1, n)
    FOR(j, 1, m) cin >> a[i][j];

  FOR(i, 1, n)
    FOR(j, 1, m)
      FOR(i1, (i - 1) * x + 1, i * x)
        FOR(j1, (j - 1) * x + 1, j * x) b[i1][j1] = a[i][j];

	//Write data
  FOR(i, 1, n * x)
  {
    FOR(j, 1, m * x) cout << b[i][j] << " ";
    cout << endl;
  }


	return 0;
}