#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
typedef tuple<ll, ll, ll, ll, ll, ll, ll> T;
const T C = make_tuple(1,0,0,0,0,0,0);
const T W = make_tuple(0,1,0,0,0,0,0);

struct SegTree{
  typedef tuple<ll, ll, ll, ll, ll, ll, ll> T;
  T e = make_tuple(0,0,0,0,0,0,0); // c, w, cw, wc, ww, cww, wwc
  T m(const T&a, const T&b){
    return make_tuple(
      get<0>(a) + get<0>(b), // c
      get<1>(a) + get<1>(b), // w
      get<2>(a) + get<2>(b) + get<0>(a)*get<1>(b), // cw
      get<3>(a) + get<3>(b) + get<1>(a)*get<0>(b), // wc
      get<4>(a) + get<4>(b) + get<1>(a)*get<1>(b), // ww
      get<5>(a) + get<5>(b) + get<0>(a)*get<4>(b) + get<2>(a)*get<1>(b), // cww
      get<6>(a) + get<6>(b) + get<1>(a)*get<3>(b) + get<4>(a)*get<0>(b)  // wwc
    );
  }
//###################################################
  typedef int i;i n;vector<T> d;
  void init(i m){n=1<<(32-__builtin_clz(m-1));d.resize(2*n-1);FOR(j,0,2*n-1)d[j]=e;}
  void init(vector<T>&v){n=1<<(32-__builtin_clz(sz(v)-1));d.resize(2*n-1);FOR(j,0,sz(v))d[j+n-1]=v[j];FORR(k, n-2, 0)d[k]=m(d[k*2+1],d[k*2+2]);}
  void update(i k,T a){k+=n-1;d[k]=a;while(k>0){k=(k-1)/2;d[k]=m(d[k*2+1],d[k*2+2]);}}
  T q(i a,i b,i k,i l,i r){return (r<=a||b<=l)?e:(a<=l&&r<=b)?d[k]:m(q(a,b,k*2+1,l,(l+r)/2),q(a,b,k*2+2,(l+r)/2,r));}
  T query(i a,i b){return q(a,b,0,0,n);}
};

vector<SegTree> segrow, segcol;
int h, w, q, a, b, c, d;
string s;
vector<T> vrow[500], vcol[500];

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> h >> w;
  segrow.resize(h);
  segcol.resize(w);
  FOR(i, 0, h){
    cin >> s;
    FOR(j, 0, w){
      T t = (s[j] == 'c' ? C : W);
      vrow[i].pb(t);
      vcol[j].pb(t);
    }
  }
  FOR(i, 0, h) segrow[i].init(vrow[i]);
  FOR(i, 0, w) segcol[i].init(vcol[i]);
  T t;
  cin >> q;
  FOR(i, 0, q){
    cin >> a >> b >> c >> d;
    a--; b--;
    ll ans = 0;
    FOR(j, a, c){
      t = segrow[j].query(b, d);
      ans += get<5>(t) + get<6>(t);
    }
    FOR(j, b, d){
      t = segcol[j].query(a, c);
      ans += get<5>(t) + get<6>(t);
    }
    cout << ans << "\n";
  }
  return 0;
}