#include<bits/stdc++.h>
using namespace std;
const long long mod1 = 998244353, mod2 = 1000000007, base = 29;
int n, m, rr;
int a[2005][2005];
char c;
long long p[2005][2005], pp[2005][2005], q[2005][2005], qq[2005][2005], w[2005][2005], ww[2005][2005], m1[2005], m2[2005];
// p 横 q 竖 w 斜
inline long long valh(int u, int v, int d, int op) {
	if (op == 1) {
		return ((p[u][v + d - 1] - p[u][v - 1] * m1[d] % mod1) % mod1 + mod1) % mod1;
	}
	return ((pp[u][v + d - 1] - pp[u][v - 1] * m2[d] % mod2) % mod2 + mod2) % mod2;
}
inline long long vals(int u, int v, int d, int op) {
	if (op == 1) {
		return ((q[u + d - 1][v] - q[u - 1][v] * m1[d] % mod1) % mod1 + mod1) % mod1;
	}
	return ((qq[u + d - 1][v] - qq[u - 1][v] * m2[d] % mod2) % mod2 + mod2) % mod2;
}
inline long long valx(int u, int v, int d, int op) {
	if (op == 1) {
		return ((w[u + d - 1][v + d - 1] - w[u - 1][v - 1] * m1[d] % mod1) % mod1 + mod1) % mod1;
	}
	return ((ww[u + d - 1][v + d - 1] - ww[u - 1][v - 1] * m2[d] % mod2) % mod2 + mod2) % mod2;
}
inline long long get_val(int u, int v, int d, int op, int opp) {
	if (op == 1) return valh(u, v, d, opp);
	else if (op == 2) return vals(u, v, d, opp);
	return valx(u, v, d, opp);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> rr;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> c;
			a[i][j] = c - 'a';
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			p[i][j] = (p[i][j - 1] * base + a[i][j]) % mod1;
			pp[i][j] = (pp[i][j - 1] * base + a[i][j]) % mod2;
			q[i][j] = (q[i - 1][j] * base + a[i][j]) % mod1;
			qq[i][j] = (qq[i - 1][j] * base + a[i][j]) % mod2;
			w[i][j] = (w[i - 1][j - 1] * base + a[i][j]) % mod1;
			ww[i][j] = (ww[i - 1][j - 1] * base + a[i][j]) % mod2;
		}
	}
	m1[0] = m2[0] = 1;
	for (int i = 1; i <= 2000; i++) {
		m1[i] = m1[i - 1] * 29 % mod1;
		m2[i] = m2[i - 1] * 29 % mod2;
	}
	int x, y, xx, yy, op, opp;
	for (int i = 1; i <= rr; i++) {
		cin >> x >> y >> c;
		int l = 0, r = max(n, m), mid;
		if (c == 'H') {
			op = 1;
			r = min(r, m - y + 1);
		} else if (c == 'V') {
			op = 2;
			r = min(r, n - x + 1);
		} else {
			op = 3;
			r = min(r, min(m - y + 1, n - x + 1));
		}
		cin >> xx >> yy >> c;
		if (c == 'H') {
			opp = 1;
			r = min(r, m - yy + 1);
		} else if (c == 'V') {
			opp = 2;
			r = min(r, n - xx + 1);
		} else {
			opp = 3;
			r = min(r, min(m - yy + 1, n - xx + 1));
		}
		while (l < r) {
			mid = (l + r + 1) >> 1;
			if (get_val(x, y, mid, op, 1) == get_val(xx, yy, mid, opp, 1) && get_val(x, y, mid, op, 0) == get_val(xx, yy, mid, opp, 0)) {
				l = mid;
			} else {
				r = mid - 1;
			}
		}
		cout << l << "\n";
	}
	return 0;
}