#include<algorithm>
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<string>
#include<vector>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
int read(){
    int s=0,f=1;
    char _z=getchar();
    while(_z<'0'||_z>'9'){
        if(_z=='-')
        f=-1;
        _z=getchar();
    }
    while(_z>='0'&&_z<='9'){
        s=(s<<3)+(s<<1)+(_z-'0');
        _z=getchar();
    }
    return s*f;
}
const int N=2e3+10,Fx[3]={0,1,1},Fy[3]={1,0,1};
char c[N][N];
int main(){
    int n=read(),m=read(),q=read();
    for(int i=1;i<=n;i++)
    scanf("%s",c[i]+1);
    while(q--){
        char af[2],bf[2];
        int ax=read(),ay=read();
        scanf("%s",af);
        int bx=read(),by=read();
        scanf("%s",bf);
        int aF=(af[0]=='H'?0:(af[0]=='V'?1:2));
        int bF=(bf[0]=='H'?0:(bf[0]=='V'?1:2));
        int res=0;
        while(ax<=n&&ay<=m&&bx<=n&&by<=m&&c[ax][ay]==c[bx][by]){
            res++;
            ax+=Fx[aF],ay+=Fy[aF];
            bx+=Fx[bF],by+=Fy[bF];
        }
        printf("%d\n",res);
    }
    return 0;
}