#include <bits/stdc++.h>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)

const int N = 2e3 + 5, M = N * N;
const int BN = 5e4 + 5;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
using Bitset = bitset<BN>;

int n, m, q;
int ti, cnt, dfn[M], low[M], sd[M], siz[M];
int in[M], mnR[M], mxR[M], mnC[M], mxC[M];
char s[N][N];
vector<int> G[M], E[M];
Bitset from[BN], to[BN];

void tarjan(int u) {
  static int tp, st[M];
  low[u] = dfn[u] = ++ti, st[++tp] = u;
  for (auto v : G[u]) {
    if (!dfn[v]) {
      tarjan(v);
      low[u] = min(low[u], low[v]);
    } else if (!sd[v]) low[u] = min(low[u], dfn[v]);
  }
  if (low[u] == dfn[u]) {
    ++cnt, sd[u] = cnt;
    while (st[tp] != u) sd[st[tp--]] = cnt;
    --tp;
  }
}
void preWork() {
  static int h = 1, t = 0, q[M];
  for (int i = 1; i <= cnt; ++i) if (!in[i]) q[++t] = i;
  map<pair<int, int>, int> mp;
  while (h <= t) {
    int u = q[h++];
    for (auto v : E[u]) {
      mnR[v] = min(mnR[v], mnR[u]);
      mxR[v] = max(mxR[v], mxR[u]);
      mnC[v] = min(mnC[v], mnC[u]);
      mxC[v] = max(mxC[v], mxC[u]);
      if (!mp.count({u, v})) {
        G[v].push_back(u);
        mp[{u, v}] = 1;
        from[v] |= from[u];
      }
      if (--in[v] == 0) q[++t] = v;
    }
  }
  for (int i = cnt; i >= 1; --i) {
    int u = q[i];
    for (auto v : G[u]) {
      to[v] |= to[u];
    }
  }
}

#define id(i, j) ((i - 1) * m + j)
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> q;
  for (int i = 1; i <= n; ++i) cin >> (s[i] + 1);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      for (int d = 0; d < 4; ++d) {
        int x = i + dx[d], y = j + dy[d];
        if (x <= 0 || y <= 0 || x > n || y > m) continue;
        if (s[i][j] == 'U' && d == 1) continue;
        if (s[i][j] == 'D' && d == 0) continue;
        if (s[i][j] == 'L' && d == 3) continue;
        if (s[i][j] == 'R' && d == 2) continue;
        G[id(i, j)].push_back(id(x, y));
      }
  for (int i = 1; i <= n * m; ++i) if (!dfn[i]) tarjan(i);
  for (int i = 1; i <= cnt; ++i)
    mnR[i] = mnC[i] = 1e9, mxR[i] = mxC[i] = 1;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) {
      int u = id(i, j);
      for (auto v : G[u]) if (sd[u] != sd[v]) {
        E[sd[u]].push_back(sd[v]);
        in[sd[v]] += 1;
      }
      u = sd[u];
      mnR[u] = min(mnR[u], i);
      mxR[u] = max(mxR[u], i);
      mnC[u] = min(mnC[u], j);
      mxC[u] = max(mxC[u], j);
      siz[u] += 1;
    }
  for (int i = 1; i <= cnt; ++i) from[i][i] = to[i][i] = 1;
  for (int i = 1; i <= cnt; ++i) G[i].clear();
  preWork();
  Bitset tmp;
  while (q--) {
    int a, b, x, y;
    cin >> a >> b >> x >> y;
    int u = sd[id(x, y)];
    int v = sd[id(a, b)];
    tmp = from[u] & to[v];
    int ans = 0;
    for (int i = tmp._Find_first(); i <= cnt; i = tmp._Find_next(i)) {
      ans += siz[i];
    }
    cout << ans << "\n";
  }
  return 0;
}