#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;
const int B = 13331;

int n, m, q;
int b[N][N];
char a[N][N];
unsigned long long hsh[N][N], hsh2[N][N], hsh3[2 * N][2 * N], pw[N * N], len[2 * N];

map < int, int > mp;

unsigned long long query ( int id, int l, int r ) {
  if ( l > r ) {
    return -114;
  }
  // cout << id << " " << l << " " << r << "cy\n";
  return hsh[id][r] - hsh[id][l - 1] * pw[r - l + 1];
}

unsigned long long query2 ( int id, int l, int r ) {
  if ( l > r ) {
    return -114;
  }
  // cout << id << " " << l << " " << r << "cy\n";
  return hsh2[id][r] - hsh2[id][l - 1] * pw[r - l + 1];
}

unsigned long long query3 ( int id, int l, int r ) {
  if ( l > r ) {
    return -114;
  }
  return hsh3[id][r] - hsh3[id][l - 1] * pw[r - l + 1];
}

int help ( int x, int y, char op, int len ) {
  if ( op == 'H' ) {
    return query ( x, y, y + len - 1 );
  }
  else if ( op == 'V' ) {
    return query2 ( y, x, x + len - 1 );
  }
  else {
    return query3 ( x - y + N, b[x][y], b[x][y] + len - 1 );
  }
}

int help2 ( int x, int y, char op ) {
  if ( op == 'H' ) {
    return m - y + 1;
  }
  else if ( op == 'V' ) {
    return n - x + 1;
  }
  else {
    return len[x - y + N];
  }
}

void Solve () {
  ios :: sync_with_stdio ( false );
  cin.tie ( 0 ), cout.tie ( 0 );
  cin >> n >> m >> q;
  for ( int i = 1; i <= n; i ++ ) {
    for ( int j = 1; j <= m; j ++ ) {
      cin >> a[i][j];
    }
  }
  pw[0] = 1;
  for ( int i = 1; i <= n * m; i ++ ) {
    pw[i] = pw[i - 1] * B;
  }
  for ( int i = 1; i <= n; i ++ ) {
    for ( int j = 1; j <= m; j ++ ) {
      hsh[i][j] = hsh[i][j - 1] * B + a[i][j];
    }
  }
  for ( int i = 1; i <= m; i ++ ) {
    for ( int j = 1; j <= n; j ++ ) {
      hsh2[i][j] = hsh2[i][j - 1] * B + a[j][i];
    }
  }
  for ( int i = 1; i <= n; i ++ ) {
    int x = i, y = 1, pos = 1;
    while ( x <= n && y <= m ) {
      hsh3[x - y + N][pos] = hsh3[x - y + N][pos - 1] * B + a[x][y];
      b[x][y] = pos;
      len[x - y + N] = pos;
      pos ++, x ++, y ++;
    }
  }
  for ( int i = 1; i <= m; i ++ ) {
    int x = 1, y = i, pos = 1;
    while ( x <= n && y <= m ) {
      hsh3[x - y + N][pos] = hsh3[x - y + N][pos - 1] * B + a[x][y];
      b[x][y] = pos;
      len[x - y + N] = pos;
      pos ++, x ++, y ++;
    }
  }
  while ( q -- ) {
    int a, b, x, y;
    char c, z;
    cin >> a >> b >> c >> x >> y >> z;
    int l = -1, r = min ( help2 ( a, b, c ), help2 ( x, y, z ) ) + 1;
    while ( l + 1 < r ) {
      int mid = l + r >> 1;
      if ( help ( a, b, c, mid ) == help ( x, y, z, mid ) ) {
        l = mid;
      }
      else {
        r = mid;
      }
    }
    cout << l << '\n';
    // cout << help ( a, b, c, 5 ) << " " << help ( x, y, z, 5 ) << '\n';
  }
}

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