#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <map>


using namespace std;

#define MOD 1000000007
#define INF 2147483647
#define ll long long

int main()
{
	int r, k, h, w;
	int tmp;
	cin >> r >> k >> h >> w;
	char c[1005][1005];

	for (int i = 0; i < h; i++) {
		scanf("%s", c[i]);
	}

	/* 回転 */
	char c1[1005][1005];
	if (r == 90 || r == 270) {
		for (int i = 0; i < w; i++) {
			for (int j = 0; j < h; j++) {
				c1[i][j] = c[h-j-1][i];
			}
		}
		tmp = h;
		h = w;
		w = tmp;
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				c[i][j] = c1[i][j];
			}
		}
	}


	if (r == 180 || r == 270) {
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				c1[i][j] = c[h - i - 1][w - j - 1];
			}
		}
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				c[i][j] = c1[i][j];
			}
		}
	}
	for (int i = 0; i < h * k; i++) {
		for (int j = 0; j < w * k; j++) {
			c1[i][j] = c[i / k][j / k];
		}
	}
	h = h * k;
	w = w * k;
	for (int i = 0; i < h * k; i++) {
		for (int j = 0; j < w * k; j++) {
			c[i][j] = c1[i][j];
		}
	}
	


	/* 表示 */
	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			printf("%c", c[i][j]);
		}
		printf("\n");
	}

	return (0);
}