#include using namespace std; #pragma GCC optimize("O3") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,1,0,-1,1,1,-1,-1,0}; const ll dx[9]={1,0,-1,0,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll h,w;cin >> h >> w; vector g(h);rep(i,h)cin >> g[i]; ll q;cin >> q; vvl pls(q,vl(4)); rep(i,q){ rep(j,4)cin >>pls[i][j],pls[i][j]--; } vl ans(q); auto calc=[&](){ rep(i,h){ rep(left,w){ vvl dp(w+1,vl(4));dp[0][0]=1; rep(right,w){ rep(_,4)dp[right+1][_]+=dp[right][_]; if(left>right)continue; if(g[i][right]=='c'){ dp[right+1][1]+=dp[right][0]; } else{ dp[right+1][2]+=dp[right][1]; dp[right+1][3]+=dp[right][2]; } } rep(j,q){ if(pls[j][0]<=i&&i<=pls[j][2]){ if(left==pls[j][1])ans[j]+=dp[pls[j][3]+1][3]; } } } } }; calc(); rep(i,h)rev(all(g[i])); rep(i,q){ tie(pls[i][1],pls[i][3])=make_pair(w-pls[i][3]-1,w-pls[i][1]-1); } calc(); { vector ng(w); rep(i,h)rep(j,w){ ng[j]+=g[i][j]; } swap(h,w);swap(g,ng); rep(i,q){ swap(pls[i][0],pls[i][1]); swap(pls[i][2],pls[i][3]); } } calc(); rep(i,h)rev(all(g[i])); rep(i,q){ tie(pls[i][1],pls[i][3])=make_pair(w-pls[i][3]-1,w-pls[i][1]-1); } calc(); rep(i,q)cout << ans[i] << endl; }