#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int H; int W; int N;
	while(~scanf("%d%d%d", &H, &W, &N)) {
		vector<string> S(H);
		rep(i, H) {
			char buf[10001];
			scanf("%s", buf);
			S[i] = buf;
		}
		vector<int> C(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &C[i]);
		vector<vector<int>> packs(W - 2);
		rep(i, N)
			packs[C[i]].push_back(i);
		vector<array<int, 3>> counts(N, {0, 0, 0});
		vector<bool> flags(N);
		vector<int> rem(W, 0);
		rep(j, W) {
			int cnt = 0;
			rep(i, H)
				cnt += S[i][j] == '#';
			for(int d = 2; d >= 0; -- d) if(0 <= j - d && j - d < W - 2) {
				for(int i : packs[j - d]) {
					if(cnt == 0) break;
					if(!flags[i]) {
						flags[i] = true;
						++ counts[i][d];
						-- cnt;
					}
				}
			}
			rem[j] = cnt;
		}
		assert(count(flags.begin(), flags.end(), true) == N);
		rep(j, W) {
			int cnt = rem[j];
			for(int d = 2; d >= 0; -- d) if(0 <= j - d && j - d < W - 2) {
				for(int i : packs[j - d]) {
					if(cnt == 0) break;
					if(counts[i][d] < 3) {
						int t = min(cnt, 3 - counts[i][d]);
						counts[i][d] += t;
						cnt -= t;
					}
				}
			}
			assert(cnt == 0);
		}
		rep(i, N) {
			rep(y, 3) {
				rep(x, 3)
					putchar(counts[i][x] > y ? '#' : '.');
				puts("");
			}
		}
	}
	return 0;
}