#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);++i)
#define FORE(x,c) for(auto &x:c)
#define FOR(i,a,n) for(int i=a,i##_len=(int)n;i<i##_len;++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i=((int)(n)-1);i>=0;--i)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define SZ(c) ((int)c.size())
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0}, DY[9]={-1,0,1,0,-1,1,1,-1,0};
const int INF=1e9*2; const long long INFLL=1e18*2;
template<class T> ostream& operator << (ostream &os, const vector<T> &v) {
    ITR(i,v) os << *i << (i==end(v)-1 ? "" : "\n"); return os; }
template<class T> istream& operator >> (istream &is, vector<T> &v) {
    ITR(i,v) is >> * i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
        is >> p.second >> p.first; return is; }
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//------------------------------------------------------------------------------

vector<string> create_pack(vi &a) {
    vector<string> ret(3,"...");
    REP(i,3) {
        int c=a[i];
        REP(j,c) {
            ret[2-j][i]='#';
        }
    }
    return ret;
}
signed main() {
    int H,W,N;
    cin>>H>>W>>N;
    vector<string> S(H);
    vector<int> C(N);
    cin>>S>>C;

    vi sum(W,0),pack(W,0),div(W,0);
    REP(j,W) {
        REP(i,H) {
            sum[j]+=(S[i][j]=='#');
        }
    }
    FORE(c,C) {
        REP(i,3) {
            pack[c+i]++;
        }
    }
    REP(i,W) {
        div[i]=sum[i]/pack[i];
    }

    // i番目のパックは左からans[i][0],ans[i][1],ans[i][2]個 (個数の合計がans[i][3])
    vector<vector<int>> ans(N,vi(4,0));
    REP(i,N) {
        int c=C[i];
        REP(j,3) {
            if(div[c+j]==0) continue;
            if(sum[c+j]<div[c+j]) {
                ans[i][j]+=sum[c+j];
                ans[i][3]+=sum[c+j];
                sum[c+j]=0;
            }
            else {
                ans[i][j]+=div[c+j];
                ans[i][3]+=div[c+j];
                sum[c+j]-=div[c+j];
            }
        }
    }

    REP(i,N) {
        if(ans[i][3]!=0) continue;
        int c=C[i];
        REP(j,3) {
            if(sum[c+j]>0) {
                ans[i][j]++;
                ans[i][3]++;
                sum[c+j]--;
                break;
            }
        }
        if(ans[i][3]==0) {
            cout<<"ERROR!"<<endl;
        }
    }
    REP(i,N) {
        int c=C[i];
        REP(j,3) {
            if(sum[c+j]==0) continue;
            if(ans[i][j]<3) {
                int t=3-ans[i][j];
                if(sum[c+j]<t) {
                    ans[i][j]+=sum[c+j];
                    ans[i][3]+=sum[c+j];
                    sum[c+j]=0;
                }
                else {
                    ans[i][j]+=t;
                    ans[i][3]+=t;
                    sum[c+j]-=t;
                }
            }
        }
    }

    REP(i,N) {
        vector<string> p=create_pack(ans[i]);
        cout<<p<<endl;
    }
    return 0;
}