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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;using vb=vector<bool>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template <typename T> T read() {T t; cin >> t; return t;}

void Main() {
  int H = read<int>();
  int W = read<int>();
  vector<string> B(H);
  rep(i, H) B[i] = read<string>();
  int Q = read<int>();

  vvi R(H+1, vi(W+1));
  vvi cs(H);

  rep(y, H) rep(x, W) {
    if (B[y][x] == 'w') {
      R[y][x] = 1;
    }
    else {
      cs[y].push_back(x);
    }
  }

  //rep(ii,sz(R)) { cout << "R["<<ii<<"]:"; rep(jj, sz(R[ii])) cout << ' ' << R[ii][jj]; cout << endl; }

  rrep(y, H) rrep(x, W) {
    if (y + 1 < H) R[y][x] += R[y+1][x];
    if (x + 1 < W) R[y][x] += R[y][x+1];
    if (y + 1 < H && x + 1 < W) R[y][x] -= R[y+1][x+1];
  }

  //rep(ii,sz(R)) { cout << "R["<<ii<<"]:"; rep(jj, sz(R[ii])) cout << ' ' << R[ii][jj]; cout << endl; }

  auto count = [&](int t, int l, int b, int r) -> ll {
    ll c = R[t][l] - R[b][l] - R[t][r] + R[b][r];
    return c * (c-1) / 2;
  };

  while (Q--) {
    int t = read<int>()-1;
    int l = read<int>()-1;
    int b = read<int>();
    int r = read<int>();
    //_p("------\n(%d,%d),(%d,%d)\n",t,l,b,r);
    ll ans = 0;
    //rep(y, t, b) rep(x, l, r) if (B[y][x] == 'c') {
    rep(y, t, b) {
      forr(x, cs[y]) if (x >= l && x < r) {
        ll nr = count(y  , x+1, y+1, r);
        ll nl = count(y  , l  , y+1, x);
        ll nt = count(t  , x  , y  , x+1);
        ll nb = count(y+1, x  , b  , x+1);
        //_p("(%d,%d): %lld,%lld,%lld,%lld\n", y,x,nr,nl,nt,nb);
        ans += nr + nl + nt + nb;
      }
    }
    cout << ans << endl;
  }
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }