#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll mod =1e6+7;

int R,K,H,W;
vector<string> rota(vector<string> v) {
    int y = v.size(), x = v[0].size();
    vector<string> ret;
    for(int i=0;i<x;i++){
        string tmp;
        for(int j=0;j<y;j++) tmp += v[j][i];
        reverse(ALL(tmp));
        ret.push_back(tmp);
    }
    return ret;
}

int main(){
    while(cin>>R>>K>>H>>W){
        vector<string> vt, exp, ans;
        string s;
        REP(i,0,H){
            cin>>s;
            vt.push_back(s);
        }
        REP(i,0,R/90){
            vt = rota(vt);
        }
        for(auto v:vt){
            REP(i,0,K) exp.push_back(v);
        }
        for(auto e:exp){
            string tmp;
            for(auto v:e){
                REP(i,0,K) tmp+=v;
            }
            ans.push_back(tmp);
        }
        for(auto a:ans){
            p(a);
        }
    }

}