#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 2e3 + 5;

char c1[N][N];

void solve(){
    int n, m, q;
    cin >> n >> m >> q;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> c1[i][j];
        }
    }
    for(int i = 1; i <= q; i++){
        int a, b, x, y;
        char c, z;
        cin >> a >> b >> c >> x >> y >> z;
        int na = a, nb = b, nx = x, ny = y;
        int ans = 0;
        while(c1[na][nb] == c1[nx][ny] && na <= n && nb <= m && nx <= n && ny <= m){
            ans++;
            if(c == 'H') nb++;
            else if(c == 'V') na++;
            else na++, nb++;
            if(z == 'H') ny++;
            else if(z == 'V') nx++;
            else nx++, ny++;
        }
        cout << ans << '\n';
    }
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}