#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <string>
#include <stack>
using ll = long long;
#define MOD 1000000007
using namespace std;

int main(){
    int R, K, H, W;
    cin >> R >> K >> H >> W;
    char c[10][10] = {'\0'};
    for(int i = 0; i < H; i++)
    {
        for(int j = 0; j < W; j++)
        {
            switch (R) {
                case 0:
                    cin >> c[i][j];
                    break;
                case 90:
                    cin >> c[j][H-1-i];
                    break;
                case 180:
                    cin >> c[H-1-i][W-1-j];
                    break;
                case 270:
                    cin >> c[W-1-j][i];
                    break;
            }
        }
    }
    if (R / 90 % 2 == 1) swap(H,W);
    for(int i = 0; i < H; i++)
    {
        for(int k = 0; k < K; k++)
        {
            for(int j = 0; j < W; j++)
            {
                for(int l = 0; l < K; l++)
                {
                    cout << c[i][j];
                }
            }
            cout << endl;
        }
    }
    return 0;
}