#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>

using namespace std;
char map[100][100];
char map_copy[100][100];

int main() {

	int r = 0, time = 0, h = 0, w = 0;
	cin >> r >> time >> h >> w;

	int angle = r / 90;
	char tmp;
	for (int i = 0; i < h; i++) {
		for (int k = 0; k < w; k++) {
			cin >> tmp;
			map[i][k] = tmp;
		}
	}
	if (angle == 0) {
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < time; j++) {
				for (int k = 0; k < w; k++) {
					for (int j = 0; j < time; j++) {
						cout << map[i][k];
					}
				}
				cout << endl;
			}
		}
	}

	if (angle == 1) {
		for (int i = 0; i < w; i++) {
			for (int j = 0; j < time; j++) {
				for (int k = h - 1; k >= 0; k--) {
					for (int j = 0; j < time; j++) {
					}
					cout << map[k][i];
				}
				cout << endl;
			}
		}

	} else if (angle == 2) {
		for (int i = h - 1; i >= 0; i--) {
			for (int j = 0; j < time; j++) {
				for (int k = w - 1; k >= 0; k--) {
					for (int j = 0; j < time; j++) {
						cout << map[i][k];
					}
				}
				cout << endl;
			}
		}
	} else if (angle == 3) {
		for (int i = w - 1; i >= 0; i--) {
			for (int j = 0; j < time; j++) {
				for (int k = 0; k < h; k++) {
					for (int j = 0; j < time; j++) {
						cout << map[k][i];

					}
				}
				cout << endl;

			}
		}
	}

	return 0;
}