#include <bits/stdc++.h>
using namespace std;
template <typename...>
static inline int getchar_unlocked(void) {
  return getchar();
}
template <typename...>
static inline void putchar_unlocked(int c) {
  putchar(c);
}
void reader(int& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
void reader(long long& x) {
  int k, m = 0;
  x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    x = x * 10 + k - '0';
  }
  if (m) x = -x;
}
int reader(char c[]) {
  int i, s = 0;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c[s++] = i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c[s++] = i;
  }
  c[s] = '\0';
  return s;
}
template <class T, class S>
void reader(T& x, S& y) {
  reader(x);
  reader(y);
}
template <class T, class S, class U>
void reader(T& x, S& y, U& z) {
  reader(x);
  reader(y);
  reader(z);
}
template <class T, class S, class U, class V>
void reader(T& x, S& y, U& z, V& w) {
  reader(x);
  reader(y);
  reader(z);
  reader(w);
}
void writer(int x, char c) {
  int s = 0, m = 0;
  char f[10];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(long long x, char c) {
  int s = 0, m = 0;
  char f[20];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(const char c[]) {
  int i;
  for (i = 0; c[i] != '\0'; i++) putchar_unlocked(c[i]);
}
void writer(const char x[], char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
template <class T>
void writerLn(T x) {
  writer(x, '\n');
}
template <class T, class S>
void writerLn(T x, S y) {
  writer(x, ' ');
  writer(y, '\n');
}
template <class T, class S, class U>
void writerLn(T x, S y, U z) {
  writer(x, ' ');
  writer(y, ' ');
  writer(z, '\n');
}
template <class T>
void writerArr(T x[], int n) {
  if (!n) {
    putchar_unlocked('\n');
    return;
  }
  for (int i = 0; i < (n - 1); i++) writer(x[i], ' ');
  writer(x[n - 1], '\n');
}
template <class T>
void chmax(T& l, const T r) {
  l = max(l, r);
}
template <class T>
void chmin(T& l, const T r) {
  l = min(l, r);
}
int n, m;
char t[510][510];
int r[510][510], c[510][510];
void init() {
  for (int i = 0; i < (n); i++)
    for (int j = 0; j < (m - 1); j++) {
      r[i + 1][j + 1] = (t[i][j] == '.' && t[i][j + 1] == '.');
    }
  for (int i = 0; i < (n - 1); i++)
    for (int j = 0; j < (m); j++) {
      c[i + 1][j + 1] = (t[i][j] == '.' && t[i + 1][j] == '.');
    }
  for (int i = 0; i < (n); i++)
    for (int j = 0; j < (m); j++) {
      r[i + 1][j + 1] = r[i + 1][j + 1] + r[i][j + 1] + r[i + 1][j] - r[i][j];
      c[i + 1][j + 1] = c[i + 1][j + 1] + c[i][j + 1] + c[i + 1][j] - c[i][j];
    }
}
int query(int r1, int c1, int r2, int c2) {
  r1--;
  c1--;
  int a = r[r2][c2 - 1] - r[r2][c1] - r[r1][c2 - 1] + r[r1][c1];
  int b = c[r2 - 1][c2] - c[r2 - 1][c1] - c[r1][c2] + c[r1][c1];
  return a + b;
}
int main() {
  reader(n, m);
  for (int i = 0; i < (n); i++) reader(t[i]);
  init();
  int q;
  reader(q);
  for (int i = 0; i < (q); i++) {
    int r1, c1, r2, c2;
    reader(r1, c1, r2, c2);
    int ans = query(r1, c1, r2, c2);
    writerLn(ans);
  }
}
