#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 2005;

int n, m, q;
char s[N][N];

string help ( int x, int y, char c ) {
  string tmp = "";
  if ( c == 'H' ) {
    while ( y <= m ) {
      tmp = tmp + s[x][y];
      y ++;
    }
  }
  else if ( c == 'V' ) {
    while ( x <= n ) {
      tmp = tmp + s[x][y];
      x ++;
    }
  }
  else {
    while ( x <= n && y <= m ) {
      tmp = tmp + s[x][y];
      x ++, y ++;
    }
  }
  return tmp;
}

void Solve () {
  cin >> n >> m >> q;
  for ( int i = 1; i <= n; i ++ ) {
    for ( int j = 1; j <= n; j ++ ) {
      cin >> s[i][j];
    }
  }
  while ( q -- ) {
    int a, b, x, y;
    char c, z;
    cin >> a >> b >> c >> x >> y >> z;
    string s = help ( a, b, c ), t = help ( x, y, z );
    int pos = 0;
    while ( s[pos] == t[pos] ) {
      pos ++;
    }
    cout << pos << '\n';
  }
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}