# include <iostream>
# include <cstdio>
# include <stdio.h>
# include <cstring>
using namespace std;
int n,m,v[405][405],b[405][405],a,c,f[405],l[405],u[405][405];
bool fl=false;
void input()
{
scanf("%d%d",&n,&m);
scanf("%d%d",&a,&c);
int i,j;
char ch;
for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
{
    cin>>ch;
    if(ch=='.')v[i][j]=0;
    else
    if(ch=='/'){fl=1;v[i][j]=1;}
    else
        {fl=1;v[i][j]=2;}
}
//cout<<"tuk"<<endl;
for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
        scanf("%d",&b[i][j]);
}
int DFS(int i, int j, int r, int p)
{
  //  cout<<i<<" "<<j<<" "<<r<<" "<<p<<endl;
    if(i<=0||i>n)return r;
    if(j<=0||j>m)return r;
    r+=b[i][j];
    if(u[i][j]==0)
    {
       // cout<<"&&"<<endl;
        if(p==1)return DFS( i+1, j, r, 1);
        if(p==2)return DFS( i, j-1, r, 2);
        if(p==3)return DFS( i-1, j, r, 3);
        if(p==4)return DFS(i, j+1, r, 4);
    }
    if(u[i][j]==1)
    {
       // cout<<"**"<<endl;
        u[i][j]=0;
         if(p==1)return DFS( i, j-1, r, 2);
        if(p==2)return DFS( i+1, j, r, 1);
        if(p==3)return DFS(i, j+1, r, 4);
        if(p==4)return DFS( i-1, j, r, 3);
    }
    if(u[i][j]==2)
    {
      //  cout<<"))"<<endl;
        u[i][j]=0;
         if(p==1)return DFS(i, j+1, r, 4);
        if(p==2)return DFS( i-1, j, r, 3);
        if(p==3)return DFS( i, j-1, r, 2);
        if(p==4)return DFS( i+1, j, r, 1);
    }
}
void DFS2(int i)
{
    int s=0;
    for(int j=1;j<=m;j++)
    {
        s+=b[i][j];
    }
    if(s>2*a){f[i]=1;l[i]=l[i-1]+1;}
    else
    {
        f[i]=0;
        l[i]=l[i-1];
    }
    for(i=1;i<=n;i++)
    {
        if(f[i]==1)
        {
            u[i][1]=2;
            u[i][m]=1;
        }
    }

}

void emptys()
{
    for(int i=1;i<=n;i++)DFS2(i);
int i,t,maxt=0,z,o,j;

 int maxs=0,s;
    for(i=1;i<=n;i++)
    {
        memset(u,0,sizeof(u));
        for(j=1;j<i;j++)
        {
            if(f[j]==1){u[j][1]=1;u[j][m]=2;}
        }
        for(j=i+1;j<=n;j++)
        {
            if(f[j]==1){u[j][1]=2;u[j][m]=1;}
        }
        if(l[i]-1>l[n]-l[i])u[i][m]=1;
        else
            u[i][m]=2;
      //  int q,w;
      /*  for(q=1;q<=n;q++)
        {
            for(w=1;w<=m;w++)
            {
                cout<<u[q][w];
            }
            cout<<endl;
        }*/

        s=DFS(i,1,0,4);
        //cout<<i<<" "<<s<<endl;
        if(s>maxs){maxs=s;t=i;}
        //cout<<s<<" "<<maxs<<" "<<t<<endl;
    }
//for(i=1;i<=n;i++)
  //  cout<<f[i]<<" "<<l[i]<<endl;
printf("%d\n",t);
for(i=1;i<=n;i++)
{
    if(f[i]==1&&t>i)printf("/");
    else
    if(f[i]==1&&t<i)printf("\\");
    else
        printf(".");
    for(j=2;j<m;j++)
    {
        printf(".");
    }
    if(f[i]==1&&t>i)printf("\\");
    else
    if(f[i]==1&&t<i)printf("/");
    else
        if(t==i)
        {
             if(l[t]-1>l[n]-l[t])printf("/");
             else
                printf("\\");
        }
    else
        printf(".");
    printf("\n");
}
}
int main()
{
freopen ("pinball.in","r",stdin);
freopen ("pinball.out","w",stdout);
input();

if(!fl){emptys();return 0;}
int i,t,q,p,maxp=0,j,r;
for(i=1;i<=n;i++)
{
    for(t=1;t<=n;t++)
        for(q=1;q<=n;q++)
        u[t][q]=v[t][q];
   p=DFS(i,1,0,1);
   //cout<<p<<endl;
   if(p>maxp){maxp=p; r=i;}
}
printf("%d\n", r);
for(i=1;i<=n;i++)
    {for(j=1;j<=m;j++)
    {
        if(v[i][j]==0)printf(".");
        if(v[i][j]==1)printf("/");
        if(v[i][j]==2)printf("\\");
    }
    printf("\n");}


}