#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <fstream>
#include <iomanip>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str(); }
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const int MOD = 1000000007;

typedef vector<char> vc;
typedef vector<vc> vvc;

int main() {
	int R, K, H, W;
	cin >> R >> K;
	cin >> H >> W;
	vvc c(H, vc(W));
	REP(i, H) {
		REP(j, W) {
			cin >> c[i][j];
		}
	}

	vvc nc;
	switch (R) {
	case 0:
		nc = vvc(H, vc(W));
		REP(i, H) {
			REP(j, W) {
				nc[i][j] = c[i][j];
			}
		}
		break;
	case 90:
		nc = vvc(W, vc(H));
		REP(i, H) {
			REP(j, W) {
				nc[j][H-i-1] = c[i][j];
			}
		}
		break;
	case 180:
		nc = vvc(H, vc(W));
		REP(i, H) {
			REP(j, W) {
				nc[i][j] = c[H-i-1][W-j-1];
			}
		}
		break;
	case 270:
		nc = vvc(W, vc(H));
		REP(i, H) {
			REP(j, W) {
				nc[W-j-1][i] = c[i][j];
			}
		}
		break;
	}

	int hh = nc.size();
	int ww = nc[0].size();
	REP(i, hh) {
		REP(p, K) {
			REP(j, ww) {
				REP(q, K) {
					cout << nc[i][j];
				}
			}
			cout << endl;
		}
	}

	return 0;
}