#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

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

	cin >> r >> k >> h >> w;

	rep(i, h) rep(j, w) cin >> c[i][j];

	if (r == 0) {
		for (int i = 0; i < h; i++) {
			for (int m = 0; m < k; m++) {
				for (int j = 0; j < w; j++) {
					for (int l = 0; l < k; l++)
						cout << c[i][j];
				}
				cout << endl;
			}
		}
	}


	if (r == 90) {
		for (int i = 0; i < w; i++) {
			for (int m = 0; m < k; m++) {
				for (int j = 0; j < h; j++) {
					for (int l = 0; l < k; l++)
						cout << c[h-j-1][i];
				}
				cout << endl;
			}
		}
	}

	if (r == 180) {
		for (int i = 0; i < h; i++) {
			for (int m = 0; m < k; m++) {
				for (int j = 0; j < w; j++) {
					for (int l = 0; l < k; l++)
						cout << c[i][w - j - 1];
				}
				cout << endl;
			}
		}
	}

	if (r == 270) {
		for (int i = 0; i < w; i++) {
			for (int m = 0; m < k; m++) {
				for (int j = 0; j < h; j++) {
					for (int l = 0; l < k; l++)
						cout << c[j][w - i-1];
				}
			 cout << endl;
			}
		}
	}
	
	return	0;
}