#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

vector<string> rotate(vector<string> s){
    int n = s.size();
    int m = s[0].size();
    vector<string> ret(m);
    REP(i,m){
        REP(j,n){
            ret[i] += s[n-1-j][i];
        }
    }

    return ret;
}

int main(){
    int r, k, h, w;
    cin >> r >> k >> h >> w;
    vector<string> s(h);
    REP(i,h) cin >> s[i];

    REP(_,r/90) s = rotate(s);

    h = s.size();
    w = s[0].size();

    vector<string> ans(k*h, string(k*w, '0'));

    REP(i,h) REP(j,w){
        FOR(ii,i*k,(i+1)*k-1) FOR(jj,j*k,(j+1)*k-1) ans[ii][jj] = s[i][j];
    }

    for (string t : ans) cout << t << endl;

    return 0;
}