#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<iomanip>
//<< setprecision(5)

using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define dme cout<<-1<<endl;return 0
const int mod=1000000007;
const int big=1e9;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-7;

template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
vector<string> rot(vector<string>& in){
	vector<string> out(in[0].size());
	for(int i=0;i<in[0].size();i++){out[i].res(in.size());}
	for(int i=0;i<in.size();i++){
		for(int j=0;j<in[i].size();j++){
			out[j][in.size()-i-1]=in[i][j];
		}
	}
	return out;
}
int main(void){
	int r,k,h,w,i,j,x,y;cin>>r>>k>>h>>w;
	vector<string>c(h);
	for(i=0;i<h;i++){cin>>c[i];}
	for(i=0;i<r/90;i++){c=rot(c);}
	if(r==90||r==270){swap(h,w);}
	vector<string>ans(h*k);
	for(i=0;i<h;i++){
		for(int a=0;a<k;a++){ans[i*k+a].res(w*k);}
		for(j=0;j<w;j++){
			for(y=i*k;y<(i+1)*k;y++){
				for(x=j*k;x<(j+1)*k;x++){
					ans[y][x]=c[i][j];
				}
			}
		}
	}
	for(i=0;i<h*k;i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}