#include <cstdio>
#include <algorithm>


using namespace std;
int n, m, h;

char top[1010][1010], xorin[1010][1010], xorana[1010][1010];

char sorin(int p) {
    for (int i=1; i<=h; ++i)
        if (xorin[i][p] == '#')
            return h-i+'1';
}

char sorina(int p) {
    for (int i=1; i<=h; ++i)
        if (xorana[i][p] == '#')
            return h-i+'1';
}

int main () {

    scanf("%d %d %d\n", &n, &m, &h);
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=m; ++j)
            scanf("%c", &top[i][j]);
        scanf("\n");
    }
    for (int i=1; i<=h; ++i) {
        for (int j=1; j<=m; ++j)
            scanf("%c", &xorin[i][j]);
        scanf("\n");
    }
    for (int i=1; i<=h; ++i) {
        for (int j=1; j<=n; ++j)
            scanf("%c", &xorana[i][j]);
        if (i<h)
        scanf("\n");
    }

    char a,b;
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=m; ++j) {
            if (top[i][j] == '#') {
                a = sorin(j);
                b = sorina(n-i+1);
                printf("%c", min(a, b) );
            } else
                printf(".");
        }
        printf("\n");
    }

    return 0;
}