#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; int main(){ ios::sync_with_stdio(false); int H, W, N; cin >> H >> W >> N; vector v; vector w; rep(i,H){ string s; cin >> s; v.push_back(s); } rep(i,N){ int a; cin >> a; w.push_back(a); } vector num(W+5,0); rep(i,H){ rep(j,W){ if(v[i][j]=='#') num[j]++; } } vector cnt(W+5,0); rep(i,N){ cnt[w[i]]++; cnt[w[i]+1]++; cnt[w[i]+2]++; } rep(i,N){ int p1 = w[i]; int p2 = w[i]+1; int p3 = w[i]+2; int ret1 = 0, ret2 = 0, ret3 = 0; bool f1 = false, f2 = false, f3 = false; if(num[p1] < cnt[p1]) f1 = true; if(num[p2] < cnt[p2]) f2 = true; if(num[p3] < cnt[p3]) f3 = true; if(f1 && f2 && f3){ if(num[p1]>0) ret1++; else if(num[p2]>0) ret2++; else ret3++; }else{ if(num[p1]>0){ if(num[p1] >= cnt[p1]) ret1 = min(3,(num[p1] + cnt[p1]-1)/cnt[p1]); else ret1 = 1; } if(num[p2]>0){ if(num[p2] >= cnt[p2]) ret2 = min(3,(num[p2] + cnt[p2]-1)/cnt[p2]); else ret2 = 1; } if(num[p3]>0){ if(num[p3] >= cnt[p3]) ret3 = min(3,(num[p3] + cnt[p3]-1)/cnt[p3]); else ret3 = 1; } } if(ret1>=3) cout << "#"; else cout << "."; if(ret2>=3) cout << "#"; else cout << "."; if(ret3>=3) cout << "#"; else cout << "."; cout << endl; if(ret1>=2) cout << "#"; else cout << "."; if(ret2>=2) cout << "#"; else cout << "."; if(ret3>=2) cout << "#"; else cout << "."; cout << endl; if(ret1>=1) cout << "#"; else cout << "."; if(ret2>=1) cout << "#"; else cout << "."; if(ret3>=1) cout << "#"; else cout << "."; cout << endl; num[p1] -= ret1; cnt[p1]--; num[p2] -= ret2; cnt[p2]--; num[p3] -= ret3; cnt[p3]--; } cout << endl; return 0; }