#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

int N, M, Q;
int cur = 2010;
string S[2005];
string R[2005], C[2005], D[4105];
int a, b, x, y;
char d1, d2;
int dir[131][2];

void __init(){
	return;
}

bool check(int l, int a, int b, int x, int y){
	if (a + dir[d1][0] * (l - 1) > N) return 0;
	if (b + dir[d1][1] * (l - 1) > M) return 0;
	if (x + dir[d2][0] * (l - 1) > N) return 0;
	if (y + dir[d2][1] * (l - 1) > M) return 0;
	while (l --){
		if (S[a][b] != S[x][y]) return 0;
		a += dir[d1][0], b += dir[d1][1];
		x += dir[d2][0], y += dir[d2][1];
	}
	return 1;
}

int solve(){
	int res = 0, l = 0, r = 2005;
	while (l <= r){
		int mid = (l + r) >> 1;
		if (check(mid, a, b, x, y)){
			res = mid;
			l = mid + 1;
		}else{
			r = mid - 1;
		}
	}
	return res;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> N >> M >> Q;
	dir['H'][0] = 0, dir['H'][1] = 1;
	dir['V'][0] = 1, dir['V'][1] = 0;
	dir['D'][0] = 1, dir['D'][1] = 1;
	for (int i = 0; i <= 2000; i ++) C[i] = R[i] = " ";
	for (int i = 0; i <= 4100; i ++) D[i] = " ";
	for (int i = 1; i <= N; i ++){
		cin >> S[i];
		S[i] = " " + S[i];
		for (int j = 1; j <= M; j ++){
			R[i].push_back(S[i][j]);
			C[j].push_back(S[i][j]);
			D[i - j + cur].push_back(S[i][j]);
		}
	}
	__init();
	while (Q --){
		cin >> a >> b >> d1 >> x >> y >> d2;
		cout << solve() << "\n";
	}
	
	return 0;
}