#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 20
#else
#define SIZE 32345
#endif

int W,H,N;
string s;
int C[SIZE];
int ans[SIZE][3];
int B[SIZE];
vector<int> P;
typedef pair<int, int> Item;
vector<Item> Q;

void solve() {
    cin>>H>>W>>N;
    REP(i,H) {
        cin>>s;
        REP(w,W) if (s[w]=='#') C[w]++;
    }
    int sum = accumulate(C, C+W, 0);
    P.resize(N);
    REP(i,N) {
        cin>>P[i];
        B[P[i]]++;
        Q.push_back(Item(P[i], i));
    }
    sort(ALL(Q));
    while(sum) {
        REP(i,N) {
            Item q = Q[i];
            REP(j,3) {
                if (C[q.first+j] && ans[q.second][j]<3) {
                    ans[q.second][j]++;
                    C[q.first+j]--;
                    sum--;
                    break;
                }
            }
        }
    }
    REP(i,N) {
        REP(h,3) {
            string l;
            REP(w,3) {
                l.push_back((ans[i][w]>h) ? '#' : '.');
            }
            out("%s\n",l.c_str());
        }
    }
}