#include #define rep(i, a, n) for(int i = a; i < n; i++) #define REP(i, n) rep(i, 0, n) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define int long long #define chmax(x, y) x = max(x, y) #define chmin(x, y) x = min(x, y) using namespace std; typedef pair P; const int mod = 1000000007; const int INF = 1e12; signed main(){ ios::sync_with_stdio(false); cin.tie(0); int r, k, h, w; cin >> r >> k >> h >> w; vector > s(h, vector(w)); r /= 90; rep(i, 0, h){ rep(j, 0, w){ cin >> s[i][j]; } } while(r--){ int H = s.size(); int W = s[0].size(); vector > t(W, vector(H)); rep(i, 0, H){ rep(j, 0, W){ t[j][H - 1 - i] = s[i][j]; } } s = t; // rep(i, 0, s.size()){ // rep(j, 0, s[i].size()){ // cout << s[i][j]; // } // cout << endl; // } } rep(i, 0, s.size() * k){ // cout << s.size() << " " << s[0].size() << " " << k << endl; rep(j, 0, s[0].size() * k){ // cout << i << " " << j << " " << i / k << " " << j / k << endl; cout << s[i / k][j / k]; } cout << endl; } }