#include <bits/stdc++.h>

using namespace std;

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], hv[MAX_N][MAX_N], hh[MAX_N][MAX_N], hd[MAX_N][MAX_N];

int main() {
	scanf("%d%d%d", &N, &M, &Q);
	for (int i = 1; i <= N; i ++) {
		scanf("%s", a[i] + 1);
	}
	pw[0] = P - 1;
	for (int i = 1; i <= N || i <= M; i ++) {
		pw[i] = 1ll * pw[i - 1] * B % P;
	}
	for (int i = N; i >= 1; i --) {
		for (int j = M; j >= 1; j --) {
			hh[i][j] = (1ll * hh[i][j + 1] * B + (a[i][j] - 'a' + 1)) % P;
			hv[i][j] = (1ll * hv[i + 1][j] * B + (a[i][j] - 'a' + 1)) % P;
			hd[i][j] = (1ll * hd[i + 1][j + 1] * B + (a[i][j] - 'a' + 1)) % P;
		}
	}
	for (int i = 1; i <= Q; i ++) {
		int x1, y1, x2, y2;
		char d1[5], d2[5];
		scanf("%d%d%s%d%d%s", &x1, &y1, &d1, &x2, &y2, &d2);
		int len1 = d1[0] == 'V' ? N - x1 + 1 : d1[0] == 'H' ? M - y1 + 1 : min(N - x1 + 1, M - y1 + 1);
		int len2 = d2[0] == 'V' ? N - x2 + 1 : d2[0] == 'H' ? M - y2 + 1 : min(N - x2 + 1, M - y2 + 1);
		int l = 0, r = max(len1, len2);
		while (l < r) {
			int m = l + r + 1 >> 1;
			int t1 = 0, t2 = 0;
			if (d1[0] == 'V') {
				t1 = (hv[x1][y1] + 1ll * hv[x1 + m][y1] * pw[m]) % P;
			} else if (d1[0] == 'H') {
				t1 = (hh[x1][y1] + 1ll * hh[x1][y1 + m] * pw[m]) % P;
			} else {
				t1 = (hd[x1][y1] + 1ll * hd[x1 + m][y1 + m] * pw[m]) % P;
			}
			if (d2[0] == 'V') {
				t2 = (hv[x2][y2] + 1ll * hv[x2 + m][y2] * pw[m]) % P;
			} else if (d2[0] == 'H') {
				t2 = (hh[x2][y2] + 1ll * hh[x2][y2 + m] * pw[m]) % P;
			} else {
				t2 = (hd[x2][y2] + 1ll * hd[x2 + m][y2 + m] * pw[m]) % P;
			}
			if (t1 == t2) {
				l = m;
			} else {
				r = m - 1;
			}
		}
		printf("%d\n", l);
	}
	return 0;

}