#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int R, K, H, W;
	cin >> R >> K >> H >> W;
	vector<string> grid(H);
	REP(i, H) cin >> grid[i];
	R /= 90;
	
	auto rotate2 = [](vector<string> grid) {
		vector<string> res(grid[0].size(), string(grid.size(), '.'));
		REP(i, grid.size()) REP(j, grid[i].size()) res[j][grid.size() - 1 - i] = grid[i][j];
		return res;
	};
	
	REP(i, R) grid = rotate2(grid);
	H = grid.size();
	W = grid[0].size();
	vector<string> ans(H * K, string(W * K, '.'));
	REP(i, H) REP(j, W) REP(k, K) REP(l, K) ans[i * K + k][j * K + l] = grid[i][j];
	REP(i, ans.size()) cout << ans[i] << endl;
}