#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

vector<string> rotate( vector<string> s ) {
    vector<string> ret;
    for ( int x = 0; x < s[0].size(); x++ ) {
        string t = "";
        for ( int y = s.size()-1; y >= 0; y-- ) {
            t += s[y][x];
        }
        ret.push_back(t);
    }
    return ret;
}

int main() {
    
    int R,K,H,W;
    cin >> R >> K >> H >> W;
    vector<string> S(H);
    for ( int i = 0; i < H; i++ ) {
        cin >> S[i];
    }

    vector<string> r;
    r = S;
    for ( int i = 0; i < R/90; i++ ) {
        r = rotate(r);
    }

    // for ( int y = 0; y < r.size(); y++ ) {
    //     cout << r[y] << endl;
    // }

    for ( int y = 0; y < r.size()*K; y++ ) {
        string t = "";
        for ( int x = 0; x < r[0].size()*K; x++ ) {
            t += r[y/K][x/K];
        }
        cout << t << endl;
    }


    return 0;
}