#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<ll,ll> pii;
typedef tuple<double,int,int> t3;

using namespace std;

int r, k, h, w;

void solve()
{
    cin >> r >> k;
    cin >> h >> w;
    vector<vector<char>> t;
    if(r % 180 == 0)
    {
        t.assign(h, vector<char>(w, 0));
    }
    else
    {
        t.assign(w, vector<char>(h, 0));
    }
    for(int y = 0;y < h;y++)
    {
        string a;
        cin >> a;
        for(int x = 0;x < w;x++)
        {
            if(r == 90)
            {
                t[x][h - 1 - y] = a[x];
            }
            else if(r == 180)
            {
                t[h- 1 -y][w - 1 - x] = a[x];
            }
            else if(r == 270)
            {
                t[w - 1 - x][y] = a[x];
            }
            else
            {
                t[y][x] = a[x];
            }
        }
    }
    vector<vector<char>> rt;
    for(int y = 0;y < t.size();y++)
    {
        vector<char> line;
        for(int x = 0;x < t[y].size();x++)
        {
            for(int j = 0;j < k;j++)
            {
                line.push_back(t[y][x]);
            }
        }
        for(int i = 0;i < k;i++)
        {
            rt.push_back(line);
        }
    }
    for(int y = 0;y < rt.size();y++)
    {
        for(int x = 0;x < rt[y].size();x++)
        {
            cout << rt[y][x];
        }
        cout << endl;
    }
}

int main()
{
    solve();
    return 0;
}