/*
TASK:mushroom
LANG:C++
*/
#include <iostream>
using namespace std;
int main()
{
char c;
int i,j,m,n,a[256][256],d,k,b[512][3],e[1024],p=0,l,s=0;
cin>>n>>m>>d;
for (i=1;i<=n;i++)
     for (j=1;j<=m+1;j++) {cin.get(c);if (c=='0') a[i][j]=0; if (c=='1') a[i][j]=1;}
for (i=1;i<=m+1;i++) a[0][i]=0;
for (i=1;i<=n+1;i++) a[i][0]=0;
for (i=1;i<=d;i++)
    cin>>e[i];
for (i=1;i<=n;i++)      
      for (j=1;j<=m;j++) a[i][j]=a[i][j+1];
for (k=2;k<=d;k++) 
{
                   //SS or RR
                   if (e[k]==e[k-1]) 
                       {
                       for (i=1;i<=n;i++)
                           for (j=1;j<=m;j++)
                               {
                               l=a[i-1][j]+a[i-1][j+1]+a[i][j+1]+a[i+1][j+1]+a[i+1][j]+a[i+1][j-1]+a[i][j-1]+a[i-1][j-1];              
                               if (l>3) {p++;b[p][1]=i;b[p][2]=j;}
                               }
                       if (p>0) for (i=1;i<=p;i++) a[b[i][1]][b[i][2]]=0;
                       p=0;
                       }
                   //RS
                   if (e[k-1]-e[k]==1)
                   {
                   for (i=1;i<=n;i++)
                        for (j=1;j<=m;j++) 
                           if (a[i][j]==1)
                            { 
                            if (a[i-1][j]!=1 && i!=1 && p<3) {p++;a[i-1][j]=-1;}
                            if (a[i-1][j-1]!=1 && i!=1 && j!=1 && p<3) {p++;a[i-1][j-1]=-1;}
                            if (a[i][j-1]!=1 && j!=1 && p<3) {p++;a[i][j-1]=-1;}
                            if (a[i+1][j-1]!=1 && j!=1 && i!=n && p<3) {p++;a[i+1][j-1]=-1;}
                            if (a[i+1][j]!=1 && i!=n && p<3) {p++;a[i+1][j]=-1;}
                            if (a[i+1][j+1]!=1 && i!=n && j!=m && p<3) {p++;a[i+1][j+1]=-1;}
                            if (a[i][j+1]!=1 && j!=m && p<3) {p++;a[i][j+1]=-1;}
                            if (a[i-1][j+1]!=1 && i!=1 && j!=m && p<3) {p++;a[i-1][j+1]=-1;}
                            }
                    for (i=1;i<=n;i++)
                        for (j=1;j<=m;j++)
                        if (a[i][j]==-1) a[i][j]=1;       
                   s=0;
                   p=0;
                   }        
}
for (i=1;i<=n;i++)
    {
    for (j=1;j<=m;j++)
        cout<<a[i][j];
    cout<<endl;
    }
return 0;
}
