// 生化武器.cpp : 定义控制台应用程序的入口点。

 //

 #include "stdafx.h"

 #include <iostream>

 #include <cstring>

 #include <queue>

 using namespace std;

 struct Point

 {

     int x, y;

     int time;

     Point(int xx, int yy, int tt)

     {

         x = xx;

         y = yy;

         time = tt;

     }

 };

 const int MAX = ;

 int n, m, t, uncnt, fillcnt, dir[][] = { , , , -, , , -,  };

 char map[MAX][MAX];

 queue<Point> q;

 int main()

 {

     while (cin>>n>>m>>t)

     {

         memset(map, '\0', sizeof(map));

         uncnt = ;

         fillcnt = ;

         for (int i = ; i < n; i++)

             cin >> map[i];

         for (int i = ; i < n; i++)

         {

             for (int j = ; j < m; j++)

             {

                 if (map[i][j] == '*')

                 {

                     Point p(i,j,);

                     map[p.x][p.y] = '#';

                     fillcnt++;

                     q.push(p);    

                 }

                 else if (map[i][j] == '.')

                 {

                     uncnt++;

                 }

             }

         }

         while (!q.empty() && t)

         {

             Point now = q.front();

             q.pop();

             //cout << "now.x:" << now.x << "\tnow.y:" << now.y << "\tnow.t:" << now.time << endl;

             if (now.time > t) break;

             for (int i = ; i < ; i++)

             {

                 int nx = now.x + dir[i][];

                 int ny = now.y + dir[i][];

                 //cout << "nx:" << nx << "\tny:" << ny << "\tmap:" << map[nx][ny] << endl;

                 if (map[nx][ny] == '.' && nx >=  && ny >=  && nx < n && ny < m)

                 {

                     Point next(nx,ny,now.time+);

                     map[next.x][next.y] = '#';

                     fillcnt++;

                     q.push(next);

                 }

             }        

         }

         if (uncnt == fillcnt) cout << "No" << endl;

         else

         {

             for (int i = ; i < n; i++)

                 cout << map[i] << endl;

         }

     }

     return ;

 }