import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int H, W, N;
string[] S;
int[] C;

void main() {
  try {
    for (; ; ) {
      H = readInt();
      W = readInt();
      N = readInt();
      S = new string[H];
      foreach (x; 0 .. H) {
        S[x] = readToken();
      }
      C = new int[N];
      foreach (j; 0 .. N) {
        C[j] = readInt();
      }
      
      auto sums = new int[W];
      foreach (y; 0 .. W) {
        foreach (x; 0 .. H) {
          if (S[x][y] == '#') {
            ++sums[y];
          }
        }
      }
      auto js = new int[][W];
      foreach (j; 0 .. N) {
        js[C[j]] ~= j;
      }
      auto ans = new int[][](N, 3);
      foreach (y; 0 .. W) {
        int s = sums[y];
        int cnt;
        foreach_reverse (d; 0 .. 3) {
          if (y - d >= 0) {
            foreach (j; js[y - d]) {
              ++cnt;
              if (s > 0 && ans[j].sum == 0) {
                --s;
                ++ans[j][d];
              }
            }
          }
        }
        foreach_reverse (d; 0 .. 3) {
          if (y - d >= 0) {
            foreach (j; js[y - d]) {
              const tmp = min(s, 3 - ans[j][d]);
              s -= tmp;
              ans[j][d] += tmp;
            }
          }
        }
        assert(s == 0);
        debug {
          writeln(ans);
        }
      }
      foreach (j; 0 .. N) {
        foreach (x; 0 .. 3) {
          foreach (d; 0 .. 3) {
            write((3 - x <= ans[j][d]) ? '#' : '.');
          }
          writeln();
        }
      }
    }
  } catch (EOFException e) {
  }
}