B'Ever since Kalevitch, a famous Berland abstractionist, heard of fractals, he made them the main topic of his canvases. Every morning the artist takes a piece of graph paper and starts with making a model of his future canvas. He takes a square as big as n xe2 x80 x89 xc3 x97 xe2 x80 x89n squares and paints some of them black. Then he takes a clean square piece of paper and paints the fractal using the following algorithm: Step 1. The paper is divided into n2 identical squares and some of them are painted black according to the model. Step 2. Every square that remains white is divided into n2 smaller squares and some of them are painted black according to the model. Every following step repeats step 2. Unfortunately, this tiresome work demands too much time from the painting genius. Kalevitch has been dreaming of making the process automatic to move to making 3D or even 4D fractals. The first line contains integers n and k (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895), where k is the amount of steps of the algorithm. Each of the following n lines contains n symbols that determine the model. Symbol xc2 xab. xc2 xbb stands for a white square, whereas xc2 xab* xc2 xbb stands for a black one. It is guaranteed that the model has at least one white square. Output a matrix nk xe2 x80 x89 xc3 x97 xe2 x80 x89nk which is what a picture should look like after k steps of the algorithm.'...