import java.util.Scanner;
import java.util.*;

public class prog {
  Scanner sc = new java.util.Scanner(System.in);

  void solve() {
    int n = sc.nextInt(), m = sc.nextInt(), h = sc.nextInt();
    char[][] mat = new char[n][];
    for (int i = 0; i < n; i++) {
      String s = sc.next();
      mat[i] = s.toCharArray();
    }
    int[] maxC = new int[m];
    for (int i = 0; i < h; i++) {
      String line = sc.next();
      for (int j = 0; j < m; j++) {
        if (line.charAt(j) == '#') {
          if (maxC[j] == 0) maxC[j] = h - i;
        }
      }
    }
    
    int[] maxL = new int[n];
    for (int i = 0; i < h; i++) {
      String line = sc.next();
      for (int j = 0; j < n; j++) {
        if (line.charAt(j) == '#') {
          if (maxL[j] == 0) maxL[j] = h - i;
        }
      }
    }
    
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (mat[i][j] == '#') {
          mat[i][j] = (char) ('0' + Math.min(maxL[n - i - 1], maxC[j])); 
        }
        System.out.print(mat[i][j]);
      }
      System.out.println();
    }
  }
  
  public static void main(final String[] args) {
    new prog().solve();
  }
}