#include <cstdio>
#include <cmath>

#include <vector>

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

template<typename T> void swap(T & x, T & y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T & a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T & a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int h, w, n;
char s[10000][10001];
int c[30000];

int block[10000];
std::vector<int> cover[10000];
int ans[30000][3];

int main() {
	scanf("%d%d%d", &h, &w, &n);
	inc(i, h) { scanf("%s", s[i]); }
	inc(i, n) { scanf("%d", &c[i]); }
	
	inc(j, w) {
		inc(i, h) { if(s[i][j] == '#') { block[j]++; } }
	}
	
	inc(i, n) { cover[ c[i] ].push_back(i); }
	
	inc(j, w) {
		inc(k, 4) {
			inc(jj, 3) {
				if(! inII(j - jj, 0, w - 3)) { continue; }
				for(auto && e : cover[j - jj]) {
					if(block[j] != 0) {
						if(
							(k != 0 && ans[e][jj] < 3) ||
							(k == 0 && jj == 1 && ans[e][0] == 0) ||
							(k == 0 && jj == 2 && ans[e][0] + ans[e][1] == 0)
						) { block[j]--; ans[e][jj]++; }
					}
				}
			}
		}
	}
	
	inc(j, w) {
		inc(k, 3) {
			inc(jj, 3) {
				if(! inII(j - jj, 0, w - 3)) { continue; }
				for(auto && e : cover[j - jj]) {
					if(block[j] != 0) { block[j]--; ans[e][jj]++; }
				}
			}
		}
	}
	
	// inc(i, n) { inc(j, 3) { printf("%d ", ans[i][j]); } printf("\n"); }
	
	inc(i, n) {
		inc(k, 3) {
		inc(j, 3) {
			printf("%c", ans[i][j] > k ? '#' : '.');
		} printf("\n");
		}
	}
	
	return 0;
}