#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<iostream>
#define RC 20+2
#define inf 1e9
#define E 50000
#define N 4000+1 
using namespace std;
char g1[RC][RC],g2[RC][RC];
int map[RC][RC];
int used[E],way[E];
int head[N],arnum=1;
struct arc{
    int next,to,cap;
}ar[E];
void add(int from,int to,int cap)
{
    ar[++arnum].next=head[from];
    ar[arnum].to=to;
    ar[arnum].cap=cap;
    head[from]=arnum;
}
void insert(int from,int to,int cap){add(from,to,cap);add(to,from,0);}
int ans;
void work(int step)
{
    ans+=1;
    for(int i=1;i<=step;i++)ar[way[i]].cap--,ar[way[i]^1].cap++;
}
int dfs(int u,int en,int step)
{
    used[u]=1;
    for(int i=head[u];i;i=ar[i].next)
    {
        int v=ar[i].to;
        int cap=ar[i].cap;
        if(!used[v]&&cap>0)
        {
            way[step]=i;
            if(v==en){work(step);return 1;}
            else if(dfs(v,en,step+1))return 1;
        }
    }
    return 0;
}
int main()
{
    int r,c,d;scanf("%d%d%d",&r,&c,&d);
    int rank=0;
    for(int i=1;i<=r;i++)
        for(int j=1;j<=c;j++)
        {    
            cin>>g1[i][j];
            if(g1[i][j]!=‘0‘)
            {
                rank++;
                map[i][j]=rank;
                insert(rank,rank+450,g1[i][j]-48);
            }
        }        
    int st=0;
    int cnt=0;
    for(int i=1;i<=r;i++)
        for(int j=1;j<=c;j++)
        {
            cin>>g2[i][j];
            if(g2[i][j]==‘L‘)
                insert(st,map[i][j],1),cnt++;
        }    
    int en=N-1;
    for(int i=1;i<=r;i++)
        for(int j=1;j<=c;j++)
        {
            if(g1[i][j]!=‘0‘)
            {
                for(int k=1;k<=r;k++)
                    for(int h=1;h<=c;h++)
                    {
                        double dx=abs(k-i);
                        double dy=abs(h-j);
                        if(hypot(dx,dy)&&sqrt(d*d)>=hypot(dx,dy)&&g1[k][h]!=‘0‘)
                            insert(map[i][j]+450,map[k][h],inf);
                    }
                if(r-i<d||i-1<d||c-j<d||j-1<d)
                    insert(map[i][j]+450,en,inf);            
            }
        }
    for(;;)
    {
        memset(used,0,sizeof(used));
        if(!dfs(st,en,1))break;
    }
    printf("%d",(cnt-ans)?(cnt-ans):0);
    return 0;
}