#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
int grid[100][100] = {};
int ans[200][200] = {};
int main() {
	int a, b;
	cin >> a >> b;
	int h, w;
	cin >> h >> w;
	REP(i, h) {
		string s;
		cin >> s;
		REP(q, w) {
			if (s[q] == '#') {
				grid[i][q] = 1;
			}
		}
	}
	for (int i = 0;i < a / 90;++i) {
		int new_grid[100][100] = {};
		for (int q = 0;q < h;++q) {
			for (int j = 0;j < w;++j) {
				new_grid[j][h - q-1] = grid[q][j];
			}
		}
		swap(h,w);
		for (int q = 0;q < h;++q) {
			for (int j = 0;j < w;++j) {
				grid[q][j] = new_grid[q][j];
			}
		}
	}
	for (int i = 0;i < h*b;++i) {
		for (int q = 0;q < w*b;++q) {
			if (grid[i/b][q/b] == 1) {
				cout << "#";
			}
			else {
				cout << ".";
			}
		}
		cout << endl;
	}
	return 0;
}