#include<bits/stdc++.h>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = INT_MAX;
const ll LLINF = LLONG_MAX;
const double eps = 1e-5;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
  
#define DIV 1000000007
typedef vector<ll> Array;
typedef vector<Array> matrix;
typedef tuple<int,int,int> tiii;
#define mt make_tuple
ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if(n&1==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}

int main(){
  int r,k,h,w; cin >> r >> k >> h >> w;
  char t[11][11] = {};
  char tt[11][11] = {};

  rep(i,h)
      cin >> t[i];
  rep(i,11)
   rep(j,11)
     tt[i][j] = t[i][j];
  while(r != 0){
    swap(h,w);
    for(int i = w - 1; i >= 0; i--)
      for(int j = 0; j < h; j++)
        tt[j][i] = t[w-i-1][j];
    r -= 90;
    rep(i,11)
      rep(j,11)
        t[i][j] = tt[i][j];
  }
  rep(i,11)
   rep(j,11)
     t[i][j] = tt[i][j];
  rep(i,h){
    rep(rr,k){
    rep(j,w){
      rep(r,k)
        cout << t[i][j];
    }
    cout << endl;
    }
  }
  return 0;
}