#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define itrep(i, a) for (auto i = (a).begin(); i != (a).end(); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

signed main() {
	int R, K, H, W;
	cin >> R >> K >> H >> W;

	vector<string> board;
	inputVector(board, H);

	vector<string> aboard;

	if (R == 0) {
		rep(y, H) {
			rep(i, K) {
				rep(x, W) {
					rep(j, K) {
						cout << board[y][x];
					}
				}
				cout << endl;
			}
		}
	} else if (R == 90) {
		rep(x, W) {
			rep(i, K) {
				rep(y, H) {
					rep(j, K) {
						cout << board[H - y - 1][x];
					}
				}
				cout << endl;
			}
		}
	} else if (R == 180) {
		rep(y, H) {
			rep(i, K) {
				rep(x, W) {
					rep(j, K) {
						cout << board[H - y - 1][W - x - 1];
					}
				}
				cout << endl;
			}
		}
	} else {
		rep(x, W) {
			rep(i, K) {
				rep(y, H) {
					rep(j, K) {
						cout << board[y][W - x - 1];
					}
				}
				cout << endl;
			}
		}
	}

    return 0;
}