// yukicoder: No.459 C-VS for yukicoder // bal4u 2019.8.17 #include #include #include //// 入出力関係 #if 1 #define gc() getchar_unlocked() #define pc(c) putchar_unlocked(c) #else #define gc() getchar() #define pc(c) putchar(c) #endif int in() { // 非負整数の入力 int n = 0, c = gc(); do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0'); return n; } void ins(char *s) { // 文字列の入力 スペース以下の文字で入力終了 char *p = s; do *s = gc(); while (*s++ > ' '); *--s = 0; } void outs(char *s) { while (*s) pc(*s++); pc('\n'); } //// 本問題関連 char blk[3][4] = {"...", "...", "..."}; void out(char a) { int i; char h[3], b[3][4]; memcpy(b, blk, sizeof(blk)); h[0] = (a >> 4) & 3, h[1] = (a >> 2) & 3, h[2] = a & 3; for (i = 0; i < 3; i++) while (h[i]) b[--h[i]][i] = '#'; outs(b[2]), outs(b[1]), outs(b[0]); } int H, W; int hi[10005]; int c[30005]; int N; int f[10005]; char S[10005]; char *ans[10005]; int g[10005]; int main() { int i, j, k, t, h[3]; H = in(), W = in(), N = in(); for (j = 0; j < H; j++) { ins(S); for (i = 0; i < W; i++) if (S[i] == '#') hi[i]++; } for (j = 0; j < N; j++) c[j] = in(), f[c[j]]++; for (i = 0; i < W; i++) if (f[i]) { ans[i] = malloc(f[i]); while (f[i]) { h[0] = h[1] = h[2] = 0, t = 0; for (j = 0; j < 3; j++) { k = i+j, t += f[k]; if (hi[k = i+j] == 0) continue; if (t <= 1) h[j] = hi[k]; else if (hi[k] < t) h[j] = 0; else if (hi[k] >= 3*t) h[j] = 3; else if (hi[k] > 3*t-2) h[j] = 2; else h[j] = 1; hi[k] -= h[j]; } if ((h[0] | h[1] | h[2]) == 0) { for (j = 0; j < 3; j++) if (hi[k = i+j]) { h[j] = 1, hi[k]--; break; } } ans[i][g[i]++] = (h[0]<<4) | (h[1]<<2) | h[2]; f[i]--; } } for (i = 0; i < N; i++) k = c[i], out(ans[k][--g[k]]); return 0; }