// #includes {{{
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <cmath>
using namespace std;
// }}}
// pre-written code {{{
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define RREP(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
//#define IFOR(i,it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();++it,++i)
#define ALL(c) (c).begin(), (c).end()
#define MP make_pair
//#define PB push_back
#define CLEAR(c,d) memset((c),(d),sizeof(c))
#define TO_STRING(VariableName) # VariableName
//#define DB(c) cout<<TO_STRING(c)<<"="<<(c)<<endl

#define EXIST(e,s) ((s).find(e)!=(s).end())
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define debug2(x) cerr << #x << " = [";REP(__ind,(x).size()){cerr << (x)[__ind] << ", ";}cerr << "] (L" << __LINE__ << ")" << endl;

#define clr(a) memset((a),0,sizeof(a))
#define nclr(a) memset((a),-1,sizeof(a))
#define pb push_back

typedef long long Int;
typedef unsigned long long uInt;
typedef long double rn;

typedef pair<int,int> pii;
//{{{ io
struct IO{ }io;//dummy
#define endl "\n"
IO& operator>>(IO &io,int &n){scanf("%d",&n);return io;}
IO& operator>>(IO &io,unsigned int &n){scanf("%u",&n);return io;}
IO& operator>>(IO &io,long long &n){scanf("%lld",&n);return io;}
IO& operator>>(IO &io,unsigned long long &n){scanf("%llu",&n);return io;}
IO& operator>>(IO &io,double &n){scanf("%lf",&n);return io;}
IO& operator>>(IO &io,long double &n){scanf("%Lf",&n);return io;}
IO& operator>>(IO &io,char *c){scanf("%s",c);return io;}
IO& operator>>(IO &io,string &s){
    char c;s.clear();
    while(isspace(c=getc(stdin))){if(c==-1)return io;}
    do{
        s.push_back(c);
    }while(!isspace(c=getc(stdin)));
    if(c!=-1)ungetc(c,stdin);
    return io;
}
IO& operator<<(IO &io,const int &n){printf("%d",n);return io;}
IO& operator<<(IO &io,const unsigned int &n){printf("%u",n);return io;}
IO& operator<<(IO &io,const long long &n){printf("%lld",n);return io;}
IO& operator<<(IO &io,const unsigned long long &n){printf("%llu",n);return io;}
IO& operator<<(IO &io,const double &n){printf("%lf",n);return io;}
IO& operator<<(IO &io,const long double &n){printf("%Lf",n);return io;}
IO& operator<<(IO &io,const char c[]){printf("%s",c);return io;}
IO& operator<<(IO &io,const string &s){
    REP(i,s.size())putc(s[i],stdout);
}
//}}}
// }}}

int ct[10010],bl[10010],C[30010],ans[30010][3];
vector<pii> v;


int main(){
	int H,W,N;
	cin>>H>>W>>N;
	memset(ct,0,sizeof(ct));
	memset(ans,0,sizeof(ans));
	memset(bl,0,sizeof(bl));
	string S;
	REP(i,H){
		cin>>S;
		REP(j,W)if(S[j]=='#')ct[j]++;
	}
	REP(i,N){
		int c;
		cin>>c;
		v.push_back(make_pair(c,i));
		bl[c]++,bl[c+1]++,bl[c+2]++;
	}
	sort(ALL(v));
	/*
	REP(i,W)cout<<ct[i]<<" ";
	cout<<endl;
	*/
	REP(i,N){
		int c = v[i].first;
		int p = 0;
		bl[c]--;bl[c+1]--;bl[c+2]--;
		REP(j,3){
			int t = c+j;
			assert(ct[t]<=bl[t]*3+3);
			if(ct[t]>=bl[t]*3+1){
				ans[v[i].second][j]=ct[t]-bl[t]*3;
			}else{
				ans[v[i].second][j]=0;
			}
			ct[t]-=ans[v[i].second][j];
			p+=ans[v[i].second][j];
		}
		if(p==0){
			REP(j,3){
				int t = c+j;
				if(ct[t]>0){
					ans[v[i].second][j]++;
					ct[t]--;
					break;
				}
				if(j==2)assert(false);
			}
		}
		/*
		cout<<"ans: ";
		REP(j,3)cout<<ans[i][j]<<" ";
		cout<<endl;
		REP(j,W)cout<<ct[j]<<" ";
		cout<<endl;
		REP(j,W)cout<<bl[j]<<" ";
		cout<<endl;
		*/
	}
	/*
	REP(ct,N){
		REP(i,3)cout<<ans[ct][i]<<" ";
		cout<<endl;
	}
	*/
	REP(ct,N){
		REP(i,3){
			REP(j,3){
				if(i<ans[ct][j]){
					cout<<"#";
				}else{
					cout<<".";
				}
			}
			cout<<endl;
		}
	}

	return 0;
}