#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;

// ctrl-E, ctrl-space

template<class T> struct Grid {
    int n, m;
    std::vector<T> v;
    constexpr Grid(std::vector<T> v) noexcept : v(v), n(v.size()) { m = (n ? (int)v[0].size() : 0); }
    constexpr Grid transpose() noexcept {
        if(n == 0) return *this;
        std::vector<T> ret(m);
        for(int i = 0; i < m; i ++) {
            ret[i].resize(n);
            for(int j = 0; j < n; j ++) ret[i][j] = v[j][i];
        }
        return Grid(ret);
    }
    constexpr Grid rev_lr() noexcept {
        std::vector<T> ret = v;
        for(int i = 0; i < n; i ++) reverse(ret[i].begin(), ret[i].end());
        return Grid(ret);
    }
    constexpr Grid rev_ud() noexcept {
        std::vector<T> ret = v;
        reverse(ret.begin(), ret.end());
        return Grid(ret);
    }
    constexpr Grid rotate(int k) noexcept {
        k %= 4;
        if(k == 0) return *this;
        if(k < 0) k += 4;
        if(k == 2) return this->rev_lr().rev_ud();
        std::vector<T> ret(m);
        if(k == 1) {
            for(int i = 0; i < m; i ++) {
                ret[i].resize(n);
                for(int j = 0; j < n; j ++) ret[i][j] = v[n - j - 1][i];
            }
        } else {
            for(int i = 0; i < m; i ++) {
                ret[i].resize(n);
                for(int j = 0; j < n; j ++) ret[i][j] = v[j][m - i - 1];
            }
        }
        return Grid(ret);
    }
};


std::string extend(std::string s, int k) {
    std::string ret = "";
    for(char c : s) ret += std::string(k, c);
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int r, k, h, w;
    std::cin >> r >> k >> h >> w;
    std::vector<std::string> c(h);
    for(int i = 0; i < h; i ++) std::cin >> c[i];
    Grid g(c);
    for(int i = 0; i < r; i += 90) g = g.transpose().rev_lr();

    for(auto s : g.v) {
        std::string t = extend(s, k);
        for(int i = 0; i < k; i ++) std::cout << t << std::endl;
    }

    return 0;
}