#include <bits/stdc++.h>

using namespace std;

const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline int read_int() {
    int x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}
inline int read_string(char* s) {
    char* s0 = s;
    for (char ch = read_char(); ch > ' '; ch = read_char()) {
        *s ++ = ch;
    }
    return s - s0;
}

char wb[BUFFER_SIZE], *wp = wb;
inline void write_flush() {
    fwrite(wb, 1, wp - wb, stdout);
    wp = wb;
}
inline void write_char(char c) {
    *wp ++ = c;
    if (wp == wb + BUFFER_SIZE) {
        write_flush();
    }
}
inline void write_int(int x) {
    if (x == 0) {
        write_char('0');
    } else if (x < 0) {
        write_char('-');
        x = -x;
    }
    static char b[32], i;
    for (i = 1; x; i ++) {
        b[i] = x % 10 + '0';
        x /= 10;
    }
    for (i --; i; i --) {
        write_char(b[i]);
    }
}

const int MAX_N = 2000 + 5;
const int B = 31, P = 999999001;

int N, M, Q;
char a[MAX_N][MAX_N];
int pw[MAX_N], hh[MAX_N][MAX_N], hv[MAX_N][MAX_N], hd[MAX_N << 1][MAX_N];
int fh[MAX_N][MAX_N], fv[MAX_N][MAX_N], fd[MAX_N << 1][MAX_N];

int main() {
    N = read_int(), M = read_int(), Q = read_int();
    for (int i = 1; i <= N; i ++) {
        read_string(a[i] + 1);
    }
    pw[0] = -1;
    for (int i = 1; i <= N || i <= M; i ++) {
        pw[i] = pw[i - 1] * B;
    }
    for (int i = N; i >= 1; i --) {
        for (int j = M; j >= 1; j --) {
            int aa = a[i][j] - 96;
            hh[i][j] = hh[i][j + 1] * B + aa;
            hv[j][i] = hv[j][i + 1] * B + aa;
            hd[i - j + M][i + j >> 1] = hd[i - j + M][i + j + 2 >> 1] * B + aa;
            fh[i][j] = a[i][j] == a[i][j + 1] ? fh[i][j + 1] + 1 : 1;
            fv[j][i] = a[i][j] == a[i + 1][j] ? fv[j][i + 1] + 1 : 1;
            fd[i - j + M][i + j >> 1] = a[i][j] == a[i + 1][j + 1] ? fd[i - j + M][i + j + 2 >> 1] + 1 : 1;
        }
    }
    for (int i = 1; i <= Q; i ++) {
        int ans = 0;
        char d1[4], d2[4];
        int x1 = read_int(), y1 = read_int();
        read_string(d1);
        int x2 = read_int(), y2 = read_int();
        read_string(d2);
        if (a[x1][y1] == a[x2][y2]) {
            int f1 = *d1 == 'H' ? fh[x1][y1] : *d1 == 'V' ? fv[y1][x1] : fd[x1 - y1 + M][x1 + y1 >> 1];
            int f2 = *d2 == 'H' ? fh[x2][y2] : *d2 == 'V' ? fv[y2][x2] : fd[x2 - y2 + M][x2 + y2 >> 1];
            if (f1 != f2) {
                ans = min(f1, f2);
            } else {
                ans += f1;
                *d1 == 'H' ? y1 += f1 : *d1 == 'V' ? x1 += f1 : (x1 += f1, y1 += f1);
                *d2 == 'H' ? y2 += f2 : *d2 == 'V' ? x2 += f2 : (x2 += f2, y2 += f2);
                int n1 = *d1 == 'H' ? M - y1 + 1 : *d1 == 'V' ? N - x1 + 1 : min(N - x1 + 1, M - y1 + 1);
                int n2 = *d2 == 'H' ? M - y2 + 1 : *d2 == 'V' ? N - x2 + 1 : min(N - x2 + 1, M - y2 + 1);
                int* h1 = *d1 == 'H' ? hh[x1] + y1 : *d1 == 'V' ? hv[y1] + x1 : hd[x1 - y1 + M] + (x1 + y1 >> 1);
                int* h2 = *d2 == 'H' ? hh[x2] + y2 : *d2 == 'V' ? hv[y2] + x2 : hd[x2 - y2 + M] + (x2 + y2 >> 1);
                int l = 0, r = min(n1, n2);
                while (l < r) {
                    int m = l + r + 1 >> 1;
                    int t1 = h1[0] + h1[m] * pw[m];
                    int t2 = h2[0] + h2[m] * pw[m];
                    t1 == t2 ? l = m : r = m - 1;
                }
                ans += l;
            }
        }
        write_int(ans), write_char('\n');
    }
    write_flush();
    fprintf(stderr, "clock=%d\n", clock());
    return 0;
}