/*
* Problem link
* http://yukicoder.me/problems/1095
*/

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> V;
typedef vector<V> VV;
typedef vector<VV> VVV;

struct INIT { INIT() { cin.tie(0); ios_base::sync_with_stdio(false); } }init;

enum DIR{UP,DOWN,LEFT,RIGHT};
int main() {
#ifdef INPUT_FROM_FILE
	ifstream cin("sample.in");
	ofstream cout("sample.out");
#endif
	/*input part*/
	int R, C;
	cin >> R >> C;

	vector<string> S(R);
	for (auto& it : S)
		cin >> it;

	int Q;
	cin >> Q;

	vector<int> rbg(Q), cbg(Q), red(Q), ced(Q);
	for (int i = 0; i < Q; i++)
		cin >> rbg[i] >> cbg[i] >> red[i] >> ced[i];


	/*DP part*/
	VVV   c(4, VV(R + 2, V(C + 2, 0)));
	VVV  cw(4, VV(R + 2, V(C + 2, 0)));
	VVV cww(4, VV(R + 2, V(C + 2, 0)));
	VVV   w(4, VV(R + 2, V(C + 2, 0)));
	VVV  ww(4, VV(R + 2, V(C + 2, 0)));
	VVV wwc(4, VV(R + 2, V(C + 2, 0)));
	VVV  wc(4, VV(R + 2, V(C + 2, 0)));
	auto update = [&](int dir,int isC, int ni, int nj, int pi, int  pj) {
		int isW = 1 - isC;
		  c[dir][ni][nj] =   c[dir][pi][pj] + isC;
		 cw[dir][ni][nj] =  cw[dir][pi][pj] + isW *  c[dir][pi][pj];
		cww[dir][ni][nj] = cww[dir][pi][pj] + isW * cw[dir][pi][pj];
		  w[dir][ni][nj] =   w[dir][pi][pj] + isW;
		 ww[dir][ni][nj] =  ww[dir][pi][pj] + isW *  w[dir][pi][pj];
		wwc[dir][ni][nj] = wwc[dir][pi][pj] + isC * ww[dir][pi][pj];
		 wc[dir][ni][nj] =  wc[dir][pi][pj] + isC *  w[dir][pi][pj];
	};
	for (int i = 1; i <= R; i++)
		for (int j = 1; j <= C; j++){
			update(RIGHT, S[i - 1][j - 1] == 'c', i, j, i, j - 1);
			update(DOWN , S[i - 1][j - 1] == 'c', i, j, i - 1, j);
			update(LEFT , S[i - 1][C - j] == 'c', i, C - j + 1, i, C - j + 2);
			update(UP   , S[R - i][j - 1] == 'c', R - i + 1, j, R - i + 2, j);
		}

	/* 1---s|t---u|v---C*/
	auto sub1=[&](int row,int s,int t,int u,int v,int d,int rd) {
		LL _c = c[d][row][u] - c[d][row][s];
		LL _cw = wc[rd][row][t] - _c * w[rd][row][v] - wc[rd][row][v];
		LL ans = 0;
		ans += c[d][row][s] * ww[rd][row][t];
		ans += cw[d][row][s] * w[rd][row][t];
		ans += _c * ww[rd][row][v];
		ans += _cw * w[rd][row][v];
		ans += cww[d][row][s];
		ans += wwc[rd][row][v];
		return ans;
	};
	auto sub2 = [&](int column, int s, int t, int u, int v, int d, int rd) {
		LL _c = c[d][u][column] - c[d][s][column];
		LL _cw = wc[rd][t][column] - _c * w[rd][v][column] - wc[rd][v][column];
		LL ans = 0;
		ans += c[d][s][column] * ww[rd][t][column];
		ans += cw[d][s][column] * w[rd][t][column];
		ans += _c * ww[rd][v][column];
		ans += _cw * w[rd][v][column];
		ans += cww[d][s][column];
		ans += wwc[rd][v][column];
		return ans;
	};

	/*output part*/
	for (int q = 0; q < Q; q++){
		LL res = 0;
		for (int i = rbg[q]; i <= red[q]; i++){
			/*right*/
			res += cww[RIGHT][i][C] - sub1(i, cbg[q] - 1, cbg[q], ced[q], ced[q] + 1, RIGHT, LEFT);
			/*left*/
			res += cww[LEFT][i][1]  - sub1(i, ced[q] + 1, ced[q], cbg[q], cbg[q] - 1, LEFT, RIGHT);
		}
		for (int i = cbg[q]; i <= ced[q]; i++) {
			/*down*/
			res += cww[DOWN][R][i] - sub2(i, rbg[q] - 1, rbg[q], red[q], red[q] + 1, DOWN, UP);
			/*up*/
			res += cww[UP][1][i] - sub2(i, red[q] + 1, red[q], rbg[q], rbg[q] - 1, UP, DOWN);
		}
		cout << res << endl;
	}
	return 0;
}