#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr;	} cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define all(x) (x).begin(), (x).end()


void print(const vector<string>& c)
{
	for (int i = 0; i < c.size(); i++) cout << c[i] << endl;
}

vector<string> rotate(const vector<string>& c, int R)
{
	int H, W;
	vector<string> res;

	switch (R)
	{
	case 0:
		return c;
	case 90:
		H = c[0].size();
		W = c.size();
		for (int i = 0; i < H; i++) {
			res.push_back(string());
			for (int j = 0; j < W; j++) {
				res[i].push_back(c[W - j - 1][i]);
			}
		}
		return res;
	case 180:
		H = c.size();
		W = c[0].size();
		for (int i = 0; i < H; i++) {
			res.push_back(string());
			for (int j = 0; j < W; j++) {
				res[i].push_back(c[H - i - 1][W - j - 1]);
			}
		}
		return res;
	case 270:
		H = c[0].size();
		W = c.size();
		for (int i = 0; i < H; i++) {
			res.push_back(string());
			for (int j = 0; j < W; j++) {
				res[i].push_back(c[j][H - i - 1]);
			}
		}
		return res;
	default:
		break;
	}
	return res;
}

vector<string> expand(const vector<string>& c, int K)
{
	vector<string> res(c.size() * K, string(c[0].size() * K, '-'));

	for (int i = 0; i < c.size(); i++) {
		for (int j = 0; j < c[0].size(); j++) {

			for (int ii = K * i; ii < K * (i + 1); ii++) {
				for (int jj = K * j; jj < K * (j + 1); jj++) {
					res[ii][jj] = c[i][j];
				}
			}

		}
	}

	return res;
}

int yuki0565()
{
	int R, K, H, W;
	cin >> R >> K >> H >> W;

	vector<string> c(H);
	for (int i = 0; i < H; i++) cin >> c[i];

	c = expand(rotate(c, R), K);
	print(c);

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0565();
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}