#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<(x)<<endl
#define fi first
#define se second

#define INF 2147483600

int yoko[500][500][500];
int tate[500][500][500];

int main(){
  int h,w;
  cin>>h>>w;
  vector<string> vec(h);
  rep(i,h) cin>>vec[i];

  rep(i,h){
    rep(l,w){
      int cnt= (vec[i][l]=='w');
      yoko[i][l][l]=0;
      repl(r,l+1,w){
        yoko[i][l][r] = yoko[i][l][r-1];
        if(vec[i][r]=='c') yoko[i][l][r] += cnt*(cnt-1)/2;
        else cnt++;
      }
    }
    for(int r=w-1; r>=0; r--){
      int cnt= (vec[i][r]=='w');
      int prev=0;
      for(int l=r-1; l>=0; l--){
        if(vec[i][l]=='c') prev += cnt*(cnt-1)/2;
        else cnt++;
        yoko[i][l][r] += prev;
//        cout<<i<<","<<l<<","<<r<<":"<<yoko[i][l][r]<<endl;
      }
    }
  }

  rep(i,w){
    rep(l,h){
      int cnt= (vec[l][i]=='w');
      repl(r,l+1,h){
        tate[i][l][r] = tate[i][l][r-1];
        if(vec[r][i]=='c') tate[i][l][r] += cnt*(cnt-1)/2;
        else cnt++;
      }
    }
    for(int r=h-1; r>=0; r--){
      int cnt= (vec[r][i]=='w');
      int prev=0;
      for(int l=r-1; l>=0; l--){
        if(vec[l][i]=='c') prev += cnt*(cnt-1)/2;
        else cnt++;
        tate[i][l][r] += prev;
      }
    }
  }

  int q;
  cin>>q;
  rep(loops,q){
    int a,b,c,d;
    scanf("%d %d %d %d", &a, &b, &c, &d);
    a--;b--;c--;d--;
    long res=0;
    for(int i=a; i<=c; i++){
      res += (long)yoko[i][b][d];
    }
    for(int i=b; i<=d; i++){
      res += (long)tate[i][a][c];
    }
    cout<<res<<endl;
  }

  return 0;
}