#include <iostream>
#include <algorithm>

using namespace std;

#define NMAX 1007

char cod;
int t[NMAX][NMAX],sol[NMAX][NMAX];
int c[NMAX],l[NMAX],m[NMAX];
int N,M,H,i,j;

int main()
{

cin>>N>>M>>H;

for (i=1;i<=N;++i)
for (j=1;j<=M;++j)
{
    cin>>cod;
    if (cod=='#') sol[i][j]=H;
}

for (i=1;i<=H;++i)
{
    for (j=1;j<=M;++j)
    {
        cin>>cod;
        if (cod=='#') c[j]=max(c[j],H-i+1);
    }
}

for (i=1;i<=N;++i)
for (j=1;j<=M;++j)
sol[i][j]=min(sol[i][j],c[j]);

for (i=1;i<=H;++i)
for (j=1;j<=N;++j)
{
    cin>>cod;
    if (cod=='#') l[N-j+1]=max(l[N-j+1],H-i+1);
}

for (i=1;i<=N;++i)
for (j=1;j<=M;++j)
sol[i][j]=min(sol[i][j],l[i]);

for (i=1;i<=N;++i,cout<<'\n')
for (j=1;j<=M;++j)
{
    if (!sol[i][j])
    {
        cout<<'.';
        continue;
    }
    cout<<sol[i][j];
}

return 0;
}