#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;
typedef unsigned long long ULL;

const int N = 2010;
const int INF = 0x3f3f3f3f;
const int base = 131;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, m, q;
char str[N][N];
ULL fc[N << 1], rhsh[N][N], dhsh[N][N], xhsh[N][N];

inline ULL gethash(int stx, int sty, int edx, int edy, int dir)
{
    if (dir == 0)
        return rhsh[edx][edy] - rhsh[stx][sty - 1] * fc[edy - sty + 1];
    if (dir == 1)
        return dhsh[edx][edy] - dhsh[stx - 1][sty] * fc[edx - stx + 1];
    else return xhsh[edx][edy] - xhsh[stx - 1][sty - 1] * fc[edy - sty + 1];
}

inline int getborder(int x, int y, int dir)
{
    if (dir == 0) return m - y + 1;
    if (dir == 1) return n - x + 1;
    if (dir == 2) return min(m - y + 1, n - x + 1);
}

inline bool check(int a, int b, int dir1, int x, int y, int dir2, int len)
{
    ULL res1 = 0, res2 = 0;
    if (dir1 == 0) res1 = gethash(a, b, a, b + len - 1, dir1);
    if (dir1 == 1) res1 = gethash(a, b, a + len - 1, b, dir1);
    if (dir1 == 2) res1 = gethash(a, b, a + len - 1, b + len - 1, dir1);

    if (dir2 == 0) res2 = gethash(x, y, x, y + len - 1, dir2);
    if (dir2 == 1) res2 = gethash(x, y, x + len - 1, y, dir2);
    if (dir2 == 2) res2 = gethash(x, y, x + len - 1, y + len - 1, dir2);

    return res1 == res2;
}

signed main()
{
    for (int i = fc[0] = 1; i < N << 1; i ++)
        fc[i] = fc[i - 1] * base;

    read(n, m, q);
    for (int i = 1; i <= n; i ++)
        scanf("%s", str[i] + 1);
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= m; j ++)
            rhsh[i][j] = rhsh[i][j - 1] * base + str[i][j];
    for (int j = 1; j <= m; j ++)
        for (int i = 1; i <= n; i ++)
            dhsh[i][j] = dhsh[i - 1][j] * base + str[i][j];
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= m; j ++)
            xhsh[i][j] = xhsh[i - 1][j - 1] * base + str[i][j];
    
    int a, b, x, y;
    char c[10], z[10];
    while (q --)
    {
        scanf("%lld%lld%s%lld%lld%s", &a, &b, c, &x, &y, z);
        int dir1 = *c == 'H' ? 0 : *c == 'V' ? 1 : 2, dir2 = *z == 'H' ? 0 : *z == 'V' ? 1 : 2;
        int l = 1, r = min(getborder(a, b, dir1), getborder(x, y, dir2)), res = 0;
        while (l <= r)
        {
            int mid = l + r >> 1;
            if (check(a, b, dir1, x, y, dir2, mid)) res = mid, l = mid + 1;
            else r = mid - 1;
        }
        cout << res << '\n';
    }

    return 0;
}