#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e4+5;
int h,w,n;
vector<pair<int,int> > b[N];
char c;
int a[N],p[N];
bool f[N];
char ans[N][4][4];
bool cmp(pair<int,int> a,pair<int,int> b){
	return f[a.first]<f[b.first];
}
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	cin>>h>>w>>n;
	for (int i=1;i<=h;i++){
		for (int j=1;j<=w;j++){
			cin>>c;
			if(c=='#') a[j]++;
		}
	}
	for (int i=1;i<=n;i++){
		cin>>p[i]; p[i]++;
		b[p[i]].push_back({i,1});
		b[p[i]+1].push_back({i,2});
		b[p[i]+2].push_back({i,3});
		for (int j=1;j<=3;j++){
			for (int k=1;k<=3;k++){
				ans[i][j][k]='.';
			}
		}
	}
	for (int i=1;i<=w;i++){
		sort(b[i].begin(),b[i].end(),cmp);
		for (pair<int,int> pr:b[i]){
			int id=pr.first,num=pr.second;
			if(a[i]>=3){
				a[i]-=3;
				ans[id][1][num]=ans[id][2][num]=ans[id][3][num]='#';
				f[id]=1;
			}
			else if(a[i]==2){
				a[i]-=2;
				ans[id][1][num]=ans[id][2][num]='#';
				f[id]=1;
			}
			else if(a[i]==1){
				a[i]--;
				ans[id][1][num]='#';
				f[id]=1;
			}
		}
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=3;j++){
			for (int k=1;k<=3;k++){
				cout<<ans[i][j][k];
			}
			cout<<'\n';
		}
	}
	return 0;
}