import java.util.Scanner;

public class prog {
	public static void main(final String[] args) {
		Scanner scan = new Scanner(System.in);
		String[] dims = scan.nextLine().split(" ");
		int n = Integer.parseInt(dims[0]);
		int m = Integer.parseInt(dims[1]);
		int h = Integer.parseInt(dims[2]);
		String[] top = new String[n];
		String[] north = new String[h];
		String[] west = new String[h];
		int[][] max = new int[n][m];
		for (int i = 0; i < n; i++) {
			top[i] = scan.nextLine();
		}
		for (int i = 0; i < h; i++) {
			north[i] = scan.nextLine();
		}
		for (int i = 0; i < h; i++) {
			west[i] = scan.nextLine();
		}
		
		for (int i = 0; i < m; i++) {
			int height = 0;
			for (int j = 0; j < h; j++) {
				if(north[j].charAt(i) == '#'){
					height++;
				}
			}
			for (int j = 0; j < n; j++) {
				if(top[j].charAt(i) == '#'){
					max[j][i] = height;
				}
			}
		}
		
		for (int i = n-1; i >= 0; i--) {
			int height = 0;
			for (int j = 0; j < h; j++) {
				if(west[j].charAt(i) == '#'){
					height++;
				}
			}
			for (int j = 0; j < m; j++) {
				if(max[n-i-1][j] > height){
					if(top[n-i-1].charAt(j) == '#'){
						max[n-i-1][j] = height;
					}
				}
			}
		}
		
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				System.out.print(max[i][j] == 0 ? "." : max[i][j]);
			}
			System.out.println();
		}
		
		scan.close();
	}
}