#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int ans[30000][3];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int H, W, N;
    cin >> H >> W >> N;
    vector<string> S(H);
    rep(y, H)cin >> S[y];
    vi nb(W);
    rep(x, W)rep(y, H)if(S[y][x] == '#')nb[x]++;

    vector<vi> cs(W);
    vi C(N);
    rep(i, N) {
        cin >> C[i];
        cs[C[i]].push_back(i);
    }

    set<pii> sp;
    rep(x, W) {
        if(sz(sp) && sp.begin()->first == x)assert(0);

        each(c, cs[x]) {
            sp.insert(mp(x+3, c));
        }
        
        while(nb[x] > 0 && sz(sp)) {
            auto it = sp.begin();
            int k = it->second;
            ans[k][x-C[k]]++;
            nb[x]--;
            sp.erase(it);
        }
    }
    
    vector<vi> x2c(W);
    rep(i, N) {
        rep(j, 3)x2c[C[i]+j].push_back(i);
    }

    rep(x, W) {
        while(nb[x] > 0) {
            int k = x2c[x].back();
            int xx = x - C[k];
            if(ans[k][xx] == 3) {
                x2c[x].pop_back();
            } else {
                ans[k][xx]++;
                nb[x]--;
            }
        }
    }

    rep(i, N) {
        rep(j, 3) {
            rep(k, 3) {
                if(ans[i][k] > j)cout << '#';
                else cout << '.';
            }
            cout << endl;
        }
    }
}