import java.io.*; import java.math.*; import java.util.*; import java.util.Map.Entry; import static java.util.Arrays.*; public class Main { private static final int mod = (int)1e9+7; final Random random = new Random(0); final IOFast io = new IOFast(); /// MAIN CODE public void run() throws IOException { // int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim()); int TEST_CASE = 1; while(TEST_CASE-- != 0) { int h = io.nextInt(); int w = io.nextInt(); char[][] cs = new char[h][]; for (int i = 0; i < h; i++) { cs[i] = io.next(); } Seg2[] seg1 = new Seg2[h]; for (int i = 0; i < h; i++) { seg1[i] = new Seg2(w); for (int j = 0; j < w; j++) { seg1[i].update(j, cs[i][j]); } } int Q = io.nextInt(); int[][] qs = io.nextIntArray2D(Q, 4); long[] ans = new long[Q]; for (int i = 0; i < Q; i++) { int y1 = qs[i][0] - 1; int x1 = qs[i][1] - 1; int y2 = qs[i][2] - 1; int x2 = qs[i][3] - 1; for (int y = y1; y <= y2; y++) { S s = seg1[y].get(x1, x2 + 1); ans[i] += s.cww; } } seg1 = null; System.gc(); Seg2[] seg2 = new Seg2[w]; for (int i = 0; i < w; i++) { seg2[i] = new Seg2(h); for (int j = 0; j < h; j++) { seg2[i].update(j, cs[j][i]); } } for (int i = 0; i < Q; i++) { int y1 = qs[i][0] - 1; int x1 = qs[i][1] - 1; int y2 = qs[i][2] - 1; int x2 = qs[i][3] - 1; for (int x = x1; x <= x2; x++) { S s = seg2[x].get(y1, y2 + 1); ans[i] += s.cww; } } for (long a : ans) io.out.println(a); } } static class S { long leftW, rightW, c, w, cww; @Override public String toString() { // TODO Auto-generated method stub return leftW + " " + rightW + " " + c + " " + w + " " + cww; } } /* static class Seg { final int n; final Seg2[] seg; public Seg(final int w, final int h) { this.n = Integer.highestOneBit(h) << 1; seg = new Seg2[this.n << 1]; for (int i = 0; i < seg.length; i++) { seg[i] = new Seg2(w); } } long get(int l, int r, int t, int b) { return get(l, r, t, b, 0, 0, n); } long get(int l, int r, int t, int b, int k, int curL, int curR) { if(curR <= l || curL >= r) return 0; if(l <= curL && curR <= r) { return seg[k].get(t, b).cww; } final int curM = (curL + curR) / 2; return get(l, r, t, b, 2 * k + 1, curL, curM) + get(l, r, t, b, 2 * k + 2, curM, curR); } void update(int x, int y, char c) { y += n - 1; seg[y].update(x, c); while(i != 0) { i = (i - 1) / 2; merge(seg[2*i+1], seg[2*i+2], seg[i]); } } } */ static class Seg2 { final int n; static S[] tmp; final S[] seg; public Seg2(final int n) { this.n = Integer.highestOneBit(n) << 1; seg = new S[this.n << 1]; if (tmp == null || tmp.length < this.n) { tmp = new S[this.n << 1]; } } S get(int l, int r) { return get(l, r, 0, 0, n); } S get(int l, int r, int k, int curL, int curR) { if(curR <= l || curL >= r) return null; if(l <= curL && curR <= r) { return seg[k]; } final int curM = (curL + curR) / 2; return tmp[k] = merge( get(l, r, 2 * k + 1, curL, curM), get(l, r, 2 * k + 2, curM, curR), tmp[k]); } S merge(S l, S r, S s) { if (l == null) return r; if (r == null) return l; if (s == null) s = new S(); // S s = new S(); s.c = l.c + r.c; s.w = l.w + r.w; s.leftW = l.leftW + r.leftW + l.w * r.c; s.rightW = l.rightW + r.rightW + r.w * l.c; s.cww = l.cww + r.cww + l.w * r.leftW + r.w * l.rightW + l.c * r.w * (r.w - 1) / 2 + r.c * l.w * (l.w - 1) / 2; return s; } void update(int i, char c) { i += n - 1; if(seg[i] == null) seg[i] = new S(); seg[i].c = seg[i].w = seg[i].leftW = seg[i].rightW = seg[i].cww = 0; if (c == 'c') seg[i].c++; else seg[i].w++; while(i != 0) { i = (i - 1) / 2; seg[i] = merge(seg[2*i+1], seg[2*i+2], seg[i]); } } } /// TEMPLATE static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); } static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); } static void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; } static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; } void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); } static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } void main() throws IOException { // IOFast.setFileIO("rle-size.in", "rle-size.out"); try { run(); } catch (EndOfFileRuntimeException e) { } io.out.flush(); } public static void main(String[] args) throws IOException { new Main().main(); } static class EndOfFileRuntimeException extends RuntimeException { private static final long serialVersionUID = -8565341110209207657L; } static public class IOFast { private BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); private PrintWriter out = new PrintWriter(System.out); void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); } void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); } void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); } private static int pos, readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500*8*2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; } public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; } public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } } int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; } public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); } public String nextString() throws IOException { return new String(next()); } public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); } // public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; } public double nextDouble() throws IOException { return Double.parseDouble(nextString()); } public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; } public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; } public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }