#include <iostream>
#include <vector>
#include <cstring>
#include <bitset>
#include <set>
#include <deque>
#include <queue>
#include <iomanip>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>
#include <sstream>
#include <functional>
#include <utility>
#include <cstdio>

using namespace std;

#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define int64 unsigned long long

int n,m,h;
char d[1001][1001];
int L[1001];
int C[1001];

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",&d[i][j]);
        }
        scanf("\n");
    }

    for(int i = h; i >= 1; i--){
        for(int j = 1; j <= m; j++){
            char s;
            scanf("%c",&s);
            if(C[j] == 0 && s == '#')
                C[j] = i;
        }
        scanf("\n");
    }

    for(int i = h; i >= 1; i--){
        for(int j = n; j >= 1; j--){
            char s;
            scanf("%c",&s);
            if(L[j] == 0 && s == '#')
                L[j] = i;
        }
        scanf("\n");
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(d[i][j] == '.') printf(".");
            else printf("%d",max(1,min(L[i],C[j])));
        }
        printf("\n");
    }

}