// https://github.com/detteiuu/AtCoder-Library/blob/main/C%2B%2B
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

bool funcH(vector<string>& A, ll i, ll j) {
    return A[i][j] == '.' && i+1 < sz(A) && A[i+1][j] == '.' && (i == 0 || A[i-1][j] == '#');
}
bool funcW(vector<string>& A, ll i, ll j) {
    return A[i][j] == '.' && j+1 < sz(A[0]) && A[i][j+1] == '.' && (j == 0 || A[i][j-1] == '#');
}
bool funcO(vector<string>& A, ll i, ll j) {
    return (A[i][j] == '.' && (i == 0 || A[i-1][j] == '#') && (i+1 == sz(A) || A[i+1][j] == '#') && 
            (j == 0 || A[i][j-1] == '#') && (j+1 == sz(A[0]) || A[i][j+1] == '#'));
}

bool funcH2(vector<string>& A, ll i, ll j, ll B, ll C, ll D, ll E) {
    return A[i][j] == '.' && i < D && A[i+1][j] == '.' && (i == B || A[i-1][j] == '#');
}
bool funcW2(vector<string>& A, ll i, ll j, ll B, ll C, ll D, ll E) {
    return A[i][j] == '.' && j < E && A[i][j+1] == '.' && (j == C || A[i][j-1] == '#');
}
bool funcO2(vector<string>& A, ll i, ll j, ll B, ll C, ll D, ll E) {
    return (A[i][j] == '.' && (i == B || A[i-1][j] == '#') && (i == D || A[i+1][j] == '#') && 
            (j == C || A[i][j-1] == '#') && (j == E || A[i][j+1] == '#'));
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    ll H, W; cin >> H >> W;
    vector<string> S(H);
    rep (i, H) {
        cin >> S[i];
    }

    vvl cum(H+1, vl(W+1, 0));
    vvl cum2(H, vl(W+1, 0));
    vvl cum3(H, vl(W+1, 0));
    rep (i, H) {
        rep (j, W) {
            if (funcH(S, i, j) || funcW(S, i, j) || funcO(S, i, j)) {
                cum[i+1][j+1] = 1;
            }
            if (funcH2(S, i, j, i, 0, H-1, W-1) || funcW2(S, i, j, i, 0, H-1, W-1) || funcO2(S, i, j, i, 0, H-1, W-1)) {
                cum2[i][j+1] = 1;
            }
            if (funcH2(S, i, j, 0, 0, i, W-1) || funcW2(S, i, j, 0, 0, i, W-1) || funcO2(S, i, j, 0, 0, i, W-1)) {
                cum3[i][j+1] = 1;
            }
        }
    }
    rep (i, H+1) rep (j, W) cum[i][j+1] += cum[i][j];
    rep (i, H) rep (j, W+1) cum[i+1][j] += cum[i][j];
    rep (i, H) rep (j, W) cum2[i][j+1] += cum2[i][j];
    rep (i, H) rep (j, W) cum3[i][j+1] += cum3[i][j];

    ll Q; cin >> Q;
    while (Q--) {
        ll A, B, C, D; cin >> A >> B >> C >> D;
        A --; B --; C --; D --;
        ll ans = 0;
        if (2 <= C-A && 2 <= D-B) {
            ans += cum[C][D]+cum[A+1][B+1]-cum[C][B+1]-cum[A+1][D];
        }
        rep2 (i, A, C+1) {
            if (A < i && i < C) {
                ans += (funcH2(S, i, B, A, B, C, D) || funcW2(S, i, B, A, B, C, D) || funcO2(S, i, B, A, B, C, D));
                if (B < D) ans += (funcH2(S, i, D, A, B, C, D) || funcW2(S, i, D, A, B, C, D) || funcO2(S, i, D, A, B, C, D));
            } else {
                if (B+1 < D) {
                    if (A < C) {
                        if (i == A) {
                            ans += cum2[A][D]-cum2[A][B+1];
                        } else {
                            ans += cum3[C][D]-cum3[C][B+1];
                        }
                    } else {
                        rep2 (j, B+1, D) {
                            ans += (funcH2(S, i, j, A, B, C, D) || funcW2(S, i, j, A, B, C, D) || funcO2(S, i, j, A, B, C, D));
                        }
                    }
                }
                ans += (funcH2(S, i, B, A, B, C, D) || funcW2(S, i, B, A, B, C, D) || funcO2(S, i, B, A, B, C, D));
                if (B < D) ans += (funcH2(S, i, D, A, B, C, D) || funcW2(S, i, D, A, B, C, D) || funcO2(S, i, D, A, B, C, D));
            }
        }

        print(ans);
    }
}