#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np

H, W = map(int, readline().split())
C = np.empty((H, W), np.bool)
for i in range(H):
    C[i] = np.frombuffer(readline().rstrip(), 'S1') == b'c'

Q = int(readline())
ABCD = np.array(read().split(), np.int64) - 1
X1 = ABCD[::4]
Y1 = ABCD[1::4]
X2 = ABCD[2::4]
Y2 = ABCD[3::4]


def solve_1d(C):
    N = len(C)
    W = np.zeros((N + 1, N), np.int64)
    for n in range(1, N + 1):
        W[n, :-1] = W[n - 1, 1:]
        W[n, : N - n + 1] += (C[: N - n + 1] == 0)
    WW = W * (W - 1) // 2
    CWW = WW * C
    for n in range(1, N + 1):
        CWW[n, :-1] += CWW[n - 1, 1:]
    return CWW


def solve(C, X1, X2, Y1, Y2):
    H, W = C.shape
    CWW = np.empty((H, W + 1, W), np.int64)
    for h in range(H):
        CWW[h] = solve_1d(C[h])


for _ in range(4):
    H, W = C.shape
    C = C[::-1].T
    X1, Y1, X2, Y2 = Y1, H - 1 - X2, Y2, H - 1 - X1
    solve(C, X1, X2, Y1, Y2)