#include<bits/stdc++.h>
using namespace std;
int read(){
int x=0,f=1;char ch=getchar();
while (ch<'0' || ch>'9'){if (ch=='-') f=-1;ch=getchar();}
while (ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int
MAX=200,
inf=10,
VerMax=2000,
EdgMax=10000;
int r,c,dd,Ecnt,sumxy,Ver;
int source,sink;
int cur[VerMax],pre[VerMax],d[VerMax];
int Q[EdgMax],gap[EdgMax];
int Map[MAX][MAX];
struct Edge{
int next,to,C;
}E[2000000];int head[VerMax];
int dist(int x,int y){
return x*x+y*y;
}
int vertexb(int i,int j){
return r*2*(i-1)+2*j;
}
void add(int u,int v,int w){
E[Ecnt].next=head[u];
E[Ecnt].to=v;
E[Ecnt].C=w;
head[u]=Ecnt++;
}
bool out(int x,int y){
y++;
for (int i=0;i<=c;i++)
if (dist(0-x,i-y)<=dd*dd) return 1;
for (int i=0;i<=r;i++)
if (dist(0-y,i-x)<=dd*dd) return 1;
for (int i=1;i<=c+1;i++)
if (dist(r+1-x,i-y)<=dd*dd) return 1;
for (int i=1;i<=r+1;i++)
if (dist(c+1-y,i-x)<=dd*dd) return 1;
return 0;
}
void build(){
char tmp[MAX]; Ecnt=0;
memset(head,255,sizeof(head));
for (int i=1;i<=r;i++)
for (int j=0;j<c;j++)
if (Map[i][j]){
int now=vertexb(i,j);
add(now+2,now+1,Map[i][j]);
add(now+1,now+2,0);
}
for (int i=1;i<=r;i++)
for (int j=0;j<c;j++){
if (!Map[i][j]) continue;
int nowb=vertexb(i,j),now;
for (int x=1;x<=r;x++)
for (int y=0;y<c;y++)
if (Map[x][y] && (x!=i || y!=j))
if (dist(x-i,y-j)<=dd*dd){
now=vertexb(x,y);
add(nowb+1,now+2,inf);
add(now+2,nowb+1,0);
add(now+1,nowb+2,inf);
add(nowb+2,now+1,0);
}
}
sumxy=0;
int Max=vertexb(r,c-1)+2;
for (int i=1;i<=r;i++){
scanf("%s",tmp);
for (int j=0;j<c;j++)
if (tmp[j]=='L'){
sumxy++;
int now=vertexb(i,j);
add(Max+1,now+2,1);
add(now+2,Max+1,0);
}
}
for (int i=1;i<=r;i++)
for (int j=0;j<c;j++)
if (Map[i][j] && out(i,j)){
int now=vertexb(i,j);
add(now+1,Max+2,inf);
add(Max+2,now+1,0);
}
source=Max+1;
sink=Max+2;
}
void BFS(){
memset(gap,0,sizeof(gap));
memset(d,255,sizeof(d));
gap[0]=1; d[sink]=0;
int Head=0,tail=1;
Q[0]=sink;
while (Head!=tail){
int u=Q[Head++];
for (int i=head[u];~i;i=E[i].next){
int j=E[i].to;
if (~d[j]) continue;
d[j]=d[u]+1;
gap[d[j]]++;
Q[tail++]=j;
}
}
}
int ISAP(){
BFS();
memcpy(cur,head,sizeof(cur));
int u,flow=0;
u=pre[source]=source;
while (d[sink]<Ver+1){
if (u==sink){
int f=inf,neck;
for (int i=source;i!=sink;i=E[cur[i]].to)
if (f>E[cur[i]].C)
neck=i,f=E[cur[i]].C;
for (int i=source;i!=sink;i=E[cur[i]].to)
E[cur[i]].C-=f,E[cur[i]^1].C+=f;
flow+=f;
u=neck;
}
int j;
for (j=cur[u];~j;j=E[j].next)
if (E[j].C && d[E[j].to]+1==d[u]) break;
if (~j){
cur[u]=j;
pre[E[j].to]=u;
u=E[j].to;
} else{
if (!(--gap[d[u]])) break;
int mind=Ver+1;
for (int i=head[u];~i;i=E[i].next)
if (E[i].C && mind>d[E[i].to])
cur[u]=i,mind=d[E[i].to];
d[u]=mind+1;
gap[d[u]]++;
u=pre[u];
}
}
return flow;
}
int main(){
r=read(),c=read(),dd=read();
char tmp[MAX];
Ver=0;
for (int i=1;i<=r;i++){
scanf("%s",tmp);
for (int j=0;j<c;j++){
Map[i][j]=tmp[j]-48;
if (Map[i][j]) Ver++;
}
}
Ver*=2; Ver+=2;
build();
printf("%d\n",sumxy-ISAP());
}
