#include #define be(v) (v).begin(),(v).end() #define pb(q) push_back(q) #define rep(i, n) for(int i=0;i std::vector transpose(const std::vector &v) { int n = v.size(); if(n == 0) return v; int m = v[0].size(); std::vector 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 ret; } template std::vector rev_lr(std::vector v) { int n = v.size(); for(int i = 0; i < n; i ++) reverse(v[i].begin(), v[i].end()); return v; } template std::vector rev_ud(std::vector v) { reverse(v.begin(), v.end()); return v; } template std::vector rotate(const std::vector &v, int k) { int n = v.size(); if(n == 0) return v; int m = v[0].size(); k %= 4; if(k < 0) k += 4; std::vector ret(m); 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]; } return 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() { int r, k, h, w; std::cin >> r >> k >> h >> w; std::vector c(h); for(int i = 0; i < h; i ++) std::cin >> c[i]; for(int i = 0; i < r; i += 90) { c = rev_lr(transpose(c)); } for(auto s : c) { std::string t = extend(s, k); for(int i = 0; i < k; i ++) std::cout << t << std::endl; } return 0; }