#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int H, W, N;
    cin >> H >> W >> N;

    vector<string> grid(H);
    for (int i = 0; i < H; ++i) {
        cin >> grid[i];
    }

    vector<int> C(N);
    for (int i = 0; i < N; ++i) {
        cin >> C[i];
    }

    vector<vector<string>> packages(N, vector<string>(3, "..."));

    for (int i = N - 1; i >= 0; --i) {
        int c = C[i];
        int max_h = -1;

        // Find the highest row where the package would land
        for (int x = c; x < c + 3; ++x) {
            for (int y = H - 1; y >= 0; --y) {
                if (grid[y][x] == '#') {
                    max_h = max(max_h, y);
                    break;
                }
            }
        }

        if (max_h == -1) {
            max_h = H - 1;
        } else {
            max_h--;
        }

        // Determine the package shape
        for (int dy = 0; dy < 3; ++dy) {
            for (int dx = 0; dx < 3; ++dx) {
                int y = max_h - dy;
                int x = c + dx;
                if (y >= 0 && y < H && x >= 0 && x < W && grid[y][x] == '#') {
                    packages[i][2 - dy][dx] = '#';
                    grid[y][x] = '.';
                }
            }
        }
    }

    // Output the packages in order
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < 3; ++j) {
            cout << packages[i][j] << endl;
        }
    }

    return 0;
}