import sys
#sys.setrecursionlimit(10 ** 6)
#sys.set_int_max_str_digits(0)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    N,K = MI()
    A = [[] for i in range(N)]
    for i in range(N):
        A[i] = LC()
    for i in range(N):
        out = [[] for k in range(K)]
        for j in range(N):
            for ki in range(K):
                for kj in range(K):
                    out[ki].append(A[i][j])
        for ki in range(K):
            print(*out[ki],sep="")
    return
solve()