#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int H,W,N;
string S;
int HH[10101];

int A[40100][3], C[40101];

void out(int a,int b,int c) {
	string B[3]={"...","...","..."};
	
	if(a>=1) B[0][0]='#';
	if(a>=2) B[1][0]='#';
	if(a>=3) B[2][0]='#';
	if(b>=1) B[0][1]='#';
	if(b>=2) B[1][1]='#';
	if(b>=3) B[2][1]='#';
	if(c>=1) B[0][2]='#';
	if(c>=2) B[1][2]='#';
	if(c>=3) B[2][2]='#';
	cout<<B[0]<<endl;
	cout<<B[1]<<endl;
	cout<<B[2]<<endl;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>H>>W>>N;
	FOR(y,H) {
		cin>>S;
		FOR(x,W) HH[x] += S[x]=='#';
	}
	vector<int> add[10101];
	FOR(i,N) {
		cin>>C[i];
		add[C[i]].push_back(i);
	}
	
	queue<int> Q[5];
	FOR(x,W) {
		for(i=2;i<=4;i++) {
			while(Q[i].size()) Q[1].push(Q[i].front()), Q[i].pop();
		}
		FORR(r,add[x]) Q[0].push(r);
		
		while(HH[x]) {
			//_P("!! %d %d : %d %d %d %d %d\n",x,HH[x],Q[0].size(),Q[1].size(),Q[2].size(),Q[3].size(),Q[4].size());
			for(i=0;i<=3;i++) {
				//_P("aa %d %d %d %d\n",x,HH[x],i,Q[i].size());
				retry:
				if(Q[i].size()) {
					y=Q[i].front();
					Q[i].pop();
					if(x>=C[y]+3) goto retry;
					HH[x]--;
					A[y][x-C[y]]++;
					Q[i+1+(i==0)].push(y);
					break;
				}
			}
			//_P("aa %d %d %d %d\n",x,HH[x],4,Q[4].size());
		}
	}
	FOR(i,N) out(A[i][0],A[i][1],A[i][2]);
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}