#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int h,w;
char mp[525][525];
int ws1[525][525],ws2[525][525];

int main(){
  scanf("%d%d",&h,&w);
  REP(i,h)scanf("%s",mp[i]);
  REP(i,h)REP(j,w)ws1[i][j+1] = ws1[i][j] + (mp[i][j]=='w');
  REP(i,h)REP(j,w)ws2[i+1][j] = ws2[i][j] + (mp[i][j]=='w');
  int q;
  scanf("%d",&q);
  while(q--){
    int a,b,c,d;
    scanf("%d%d%d%d",&a,&b,&c,&d);--a;--b;
    ll ans = 0;
    FOR(i,a,c)FOR(j,b,d){
      if(mp[i][j]=='c'){
        ll tmp;
        tmp = ws1[i][d] - ws1[i][j];
        ans += tmp*(tmp-1)/2;
        tmp = ws1[i][j] - ws1[i][b];
        ans += tmp*(tmp-1)/2;
        tmp = ws2[c][j] - ws2[i][j];
        ans += tmp*(tmp-1)/2;
        tmp = ws2[i][j] - ws2[a][j];
        ans += tmp*(tmp-1)/2;
      }
    }
    printf("%lld\n",ans);
  }
  return 0;
}