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

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

const int N = 2e3 + 5, M = N * N;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};

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

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;
  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 (--in[v] == 0) q[++t] = v;
    }
  }
}

#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);
    }
  preWork();
  static int sum[N][N];
  auto add = [&](int x1, int x2, int y1, int y2) {
    sum[x1][y1] += 1;
    sum[x1][y2 + 1] += -1;
    sum[x2 + 1][y1] += -1;
    sum[x2 + 1][y2 + 1] += 1;
  };
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      int u = sd[id(i, j)];
      add(mnR[u], mxR[u], mnC[u], mxC[u]);
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      sum[i][j] += -sum[i - 1][j - 1] + sum[i - 1][j] + sum[i][j - 1];
    }
  }
  while (q--) {
    int a, b, x, y;
    cin >> a >> b >> x >> y;
    int u = sd[id(x, y)];
    if (a >= mnR[u] && a <= mxR[u] && b >= mnC[u] && b <= mxC[u]) {
      int ans = 0;
      for (int i = mnR[u]; i <= mxR[u]; ++i) {
        for (int j = mnC[u]; j <= mxC[u]; ++j) {
          int v = sd[id(i, j)];
          if (a >= mnR[v] && a <= mxR[v] && b >= mnC[v] && b <= mxC[v]) ++ans;
        }
      }
      cout << ans << "\n";
    } else cout << 0 << "\n";
  }
  return 0;
}