#include<bits/stdc++.h>
#define N 550000
#define M 100005
using namespace std;
int a[N][4],b[5]={-1,0,1,0,-1},d[M],e[M],f[M],g[M],h[M],i,j,l,m,n,o[N<<2],p[N<<2],q,s[N<<3],t,z;char c[N];bool w[N][4];
void add(int u){while(u<=t<<1)s[u]++,u+=u&-u;}
void del(int u){while(u<=t<<1)s[u]--,u+=u&-u;}
bool cmp(int u,int v){return a[d[u]][f[u]]<a[d[v]][f[v]];}
void dfs(int u,int v)
{
	++v%=4;
	while(!w[u][v])(v+=3)%=4;
	if(a[u][v]<=t)return;
	a[u][v]=++t,o[t]=u,p[t]=v;
	dfs(u+m*b[v]+b[v+1],v);
}
inline int sum(int u)
{
	int v=0;
	while(u)v+=s[u],u-=u&-u;
	return v;
}
int main()
{
	scanf("%d%d%d%*s",&n,&m,&q);
	memset(a,0x7f,sizeof a);
	for(i=1;i<=n;i++)
	{
		for(scanf("%s",c),j=1;j<m;j++)if(c[j<<1]=='.')w[(i-1)*m+j][1]=w[(i-1)*m+j+1][3]=1;
		for(scanf("%s",c+1),j=1;j<=m;j++)if(c[j<<1]=='.')w[(i-1)*m+j][2]=w[i*m+j][0]=1;
	}
	for(i=0;i<q;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		d[i]=(x-1)*m+y;
		scanf("%d%d",&x,&y);
		e[i]=(x-1)*m+y;
		scanf("%s",c),g[i]=i;
		if(*c=='U')f[i]=0;
		else if(*c=='R')f[i]=1;
		else if(*c=='D')f[i]=2;
		else if(*c=='L')f[i]=3;
		while(!w[d[i]][f[i]])(f[i]+=3)%=4;
	}
	for(dfs(1,0),i=1;i<=n*m;i++)add(min(min(a[i][0],a[i][1]),min(a[i][2],a[i][3])));
	for(sort(g,g+q,cmp),i=1,j=0;j<q;)
	{
		while(i<=t&&a[d[g[j]]][f[g[j]]]>i)
		del(i),a[o[i]][p[i]]+=t,add(min(min(a[o[i]][0],a[o[i]][1]),min(a[o[i]][2],a[o[i]][3]))),i++;
		while(j<q&&a[d[g[j]]][f[g[j]]]==i)
		h[g[j]]=sum(min(min(a[e[g[j]]][0],a[e[g[j]]][1]),min(a[e[g[j]]][2],a[e[g[j]]][3]))),j++;
	}
	for(i=0;i<q;i++)printf("%d\n",h[i]);
	return 0;
}