#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=1e3+10,Maxm=1e4+10;
int col[Maxn][Maxn];
int n,m;
int vis[Maxn][Maxn];
vector<pii> to[Maxn][Maxn];
int dfn[Maxn][Maxn],low[Maxn][Maxn];
int idx;
char c[Maxn];
inline bool check(int x,int y){return x>=1 && x<=n && y>=1 && y<=m;}
int q;
inline void init(){
    n=read();m=read();q=read();
    fr(i,1,n){
        scanf("%s",c+1);
        fr(j,1,m){
            if(check(i,j-1) && c[j]!='L') to[i][j].pb(mk(i,j-1));
            if(check(i,j+1) && c[j]!='R') to[i][j].pb(mk(i,j+1));
            if(check(i-1,j) && c[j]!='U') to[i][j].pb(mk(i-1,j));
            if(check(i+1,j) && c[j]!='D') to[i][j].pb(mk(i+1,j));
        }
    }
}
stack<pii> st;
int color;
inline void chkmin(int &x,int y){if(x>y) x=y;}
inline void dfs(int x,int y){
    // cerr<<x<<' '<<y<<endl;
    dfn[x][y]=low[x][y]=++idx;vis[x][y]=1;st.push(mk(x,y));
    for(auto p:to[x][y]){
        int nx,ny;nx=p.first,ny=p.second;
        if(!dfn[nx][ny]){dfs(nx,ny);chkmin(low[x][y],low[nx][ny]);}
        else if(vis[nx][ny]) chkmin(low[x][y],dfn[nx][ny]);
    }
    if(dfn[x][y]==low[x][y]){
        ++color;
        int nx,ny;
        do{
            nx=st.top().first;ny=st.top().second;
            col[nx][ny]=color;vis[nx][ny]=0;
            st.pop();
        }while(!(nx==x && ny==y));
    }
}
int siz[Maxm];
vector<int> vc[Maxm];
bitset<Maxm> bt[Maxm];
int in[Maxm];
inline void work(){
    fr(i,1,n) fr(j,1,m) if(!dfn[i][j]) dfs(i,j);
    // fr(i,1,n){
    //     fr(j,1,m) writepl(col[i][j]);puts("");
    // }
    fr(i,1,n) fr(j,1,m) siz[col[i][j]]++;
    fr(x,1,n) fr(y,1,m) for(auto p:to[x][y]){
        int nx,ny;nx=p.first;ny=p.second;
        if(col[x][y]!=col[nx][ny]){
            // cout<<col[x][y]<<' '<<col[nx][ny]<<endl;
            vc[col[x][y]].pb(col[nx][ny]);
        }
    }
    fr(i,1,color){
        vector<int> now;sort(vc[i].begin(),vc[i].end());
        for(int j=0;j<vc[i].size();++j) if(j==0 || vc[i][j]!=vc[i][j-1]) now.pb(vc[i][j]);
        swap(now,vc[i]);
        for(auto x:vc[i]) in[x]++;
    }
    queue<int> que;
    fr(i,1,color) bt[i][i]=1;
    fr(i,1,color) if(!in[i]) que.push(i);
    // fr(i,1,color){
    //     cout<<"id="<<i<<":\n";
    //     for(auto x:vc[i]) cout<<x<<' ';cout<<endl;
    // }
    while(!que.empty()){
        int x=que.front();que.pop();
        for(auto y:vc[x]){
            bt[y]|=bt[x];--in[y];
            if(!in[y]) que.push(y);
        }
    }
    while(q--){
        int sx,sy,tx,ty;
        sx=read();sy=read();tx=read();ty=read();
        int ans=0,col1=col[sx][sy],col2=col[tx][ty];
        fr(i,1,color) if(bt[i][col1] && bt[col2][i]) ans+=siz[i];
        writeln(ans);
    }
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}