from heapq import heappush, heappop, heapify
import sys
from collections import defaultdict, deque,Counter
from math import ceil, floor, sqrt, factorial,gcd
from itertools import permutations, combinations,product
from bisect import bisect_left, bisect_right
from copy import deepcopy
from functools import lru_cache #@lru_cache(maxsize=None)
from fractions import Fraction
sys.setrecursionlimit(10**6)
# input = sys.stdin.readline
vector1 = [[0, -1], [1, 0], [0, 1], [-1, 0]]
vector2 = [[0, 1], [1, 0], [-1, 0], [0, -1],
           [1,-1], [-1, 1], [1, 1], [-1, -1]]


def main():
    N,K = map(int,input().split())
    A = [input() for i in range(N)]
    B = []
    for i in range(N):
        tmp = []
        for j in range(N):
            tmp.append(A[i][j]*K)
        tmp = "".join(tmp)
        for j in range(K):
            B.append(tmp)
    for i in range(N*K):
        print(B[i])
    
if __name__ == '__main__':
    main()