#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	int R; int K;
	while (~scanf("%d%d", &R, &K)) {
		int H; int W;
		scanf("%d%d", &H, &W);
		vector<string> A(H * K);
		rep(i, H) {
			char buf[101];
			scanf("%s", buf);
			rep(l, K) rep(j, W) rep(k, K)
				A[i * K + l] += buf[j];
		}
		H *= K, W *= K;
		rep(k, R / 90) {
			vector<string> B(W, string(H, '?'));
			rep(i, H) rep(j, W)
				B[j][H-1-i] = A[i][j];
			A = B;
			swap(H, W);
		}
		rep(i, H)
			puts(A[i].c_str());
	}
	return 0;
}