They say "years are like dominoes, tumbling one after the other". But would a year fit into a grid? I don't think so.

Limak is a little polar bear who loves to play. He has recently got a rectangular grid with h rows and w columns. Each cell is a square, either empty (denoted by '.') or forbidden (denoted by '#'). Rows are numbered 1 through h from top to bottom. Columns are numbered 1 through w from left to right.

Also, Limak has a single domino. He wants to put it somewhere in a grid. A domino will occupy exactly two adjacent cells, located either in one row or in one column. Both adjacent cells must be empty and must be inside a grid.

Limak needs more fun and thus he is going to consider some queries. In each query he chooses some rectangle and wonders, how many way are there to put a single domino inside of the chosen rectangle?

Input

The first line of the input contains two integers h and w (1 ≤ h, w ≤ 500) – the number of rows and the number of columns, respectively.

The next h lines describe a grid. Each line contains a string of the length w. Each character is either '.' or '#' — denoting an empty or forbidden cell, respectively.

The next line contains a single integer q (1 ≤ q ≤ 100 000) — the number of queries.

Each of the next q lines contains four integers r1i, c1i, r2i, c2i (1 ≤ r1i ≤ r2i ≤ h, 1 ≤ c1i ≤ c2i ≤ w) — the i-th query. Numbers r1i and c1i denote the row and the column (respectively) of the upper left cell of the rectangle. Numbers r2i and c2i denote the row and the column (respectively) of the bottom right cell of the rectangle.

Output

Print q integers, i-th should be equal to the number of ways to put a single domino inside the i-th rectangle.

Examples

Input

5 8
....#..#
.#......
##.#....
##..#.##
........
4
1 1 2 3
4 1 4 1
1 2 4 5
2 5 5 8


Output

4
0
10
15


Input

7 39
.......................................
.###..###..#..###.....###..###..#..###.
...#..#.#..#..#.........#..#.#..#..#...
.###..#.#..#..###.....###..#.#..#..###.
.#....#.#..#....#.....#....#.#..#..#.#.
.###..###..#..###.....###..###..#..###.
.......................................
6
1 1 3 20
2 10 6 30
2 10 7 30
2 2 7 7
1 7 7 7
1 8 7 8


Output

53
89
120
23
0
2

Note

A red frame below corresponds to the first query of the first sample. A domino can be placed in 4 possible ways.

<image>
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.Reader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class C {
    public static void main(String[] args) {
//        Scanner sc = new Scanner(System.in);
//        FastScanner sc = new FastScanner();

        int height = ni();
        int width = ni();
        boolean[][] grid = new boolean[height+1][width+1];
        for (int y = 1; y <= height; y++) {
            String line = n();
            for (int x = 1; x <= width; x++) {
                grid[y][x] = line.charAt(x-1) == '.';
            }
        }

        int[][] fenwick = new int[height+1][width+1];
        int[][] startFenwickHorizontal = new int[height+1][width+1];
        int[][] startFenwickVertical = new int[height+1][width+1];

        for (int row = 1; row <= height; row++) {
            for (int col = 1; col <= width; col++) {
                if (grid[row][col] && grid[row][col-1]) {
                    add(startFenwickHorizontal, row, col-1, 1);
                    add(fenwick, row, col, 1);
                }
            }
        }
        for (int row = 1; row <= height; row++) {
            for (int col = 1; col <= width; col++) {
                if (grid[row][col] && grid[row-1][col]) {
                    add(startFenwickVertical, row-1, col, 1);
                    add(fenwick, row, col, 1);
                }
            }
        }

//        for (int row = 1; row <= height; row++) {
//            List<Integer> sums = new ArrayList<>();
//            for (int col = 1; col <= width; col++) {
//                sums.add(get(fenwick, row, col));
//            }
//            System.out.println(sums);
//        }
//        System.out.println("=================");
//        for (int row = 1; row <= height; row++) {
//            List<Integer> sums = new ArrayList<>();
//            for (int col = 1; col <= width; col++) {
//                sums.add(sum(fenwick, row, col));
//            }
//            System.out.println(sums);
//        }

        StringBuilder sb = new StringBuilder();
        int numQueries = ni();
        for (int i = 0 ; i < numQueries; i++) {
            int r1 = ni();
            int c1 = ni();
            int r2 = ni();
            int c2 = ni();
//            System.out.println(sum(startFenwick, r1-1, 0, r1-1, c2));
//            System.out.println(sum(startFenwick, r1, 0, r2, c1-1));
            int sumStartingAbove = sum(startFenwickHorizontal, 0, 0, r1-1, c2-1)
                    + sum(startFenwickVertical, 0, 0, r1-1, c2);
            int sumStartingLeft = sum(startFenwickHorizontal, r1, 0, r2, c1-1)
                    + sum(startFenwickVertical, r1, 0, r2-1, c1-1);
//            System.out.println(sumStartingAbove);
//            System.out.println(sumStartingLeft);
            int ans = sum(fenwick, r2, c2) - sumStartingAbove - sumStartingLeft;
            sb.append(ans).append('\n');
        }

        System.out.print(sb);
    }

    public static void add(int[][] t, int r, int c, int value) {
        for (int i = r; i < t.length; i |= i + 1)
            for (int j = c; j < t[0].length; j |= j + 1)
                t[i][j] += value;
    }

    // sum[(0, 0), (r, c)]
    public static int sum(int[][] t, int r, int c) {
        int res = 0;
        for (int i = r; i >= 0; i = (i & (i + 1)) - 1)
            for (int j = c; j >= 0; j = (j & (j + 1)) - 1)
                res += t[i][j];
        return res;
    }

    // sum[(r1, c1), (r2, c2)]
    public static int sum(int[][] t, int r1, int c1, int r2, int c2) {
        return sum(t, r2, c2) - sum(t, r1 - 1, c2) - sum(t, r2, c1 - 1) + sum(t, r1 - 1, c1 - 1);
    }

    public static int get(int[][] t, int r, int c) {
        return sum(t, r, c, r, c);
    }

    public static void set(int[][] t, int r, int c, int value) {
        add(t, r, c, -get(t, r, c) + value);
    }

    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer st;
    static String n() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }
    static int ni() {
        return Integer.parseInt(n());
    }
    long nl() {
        return Long.parseLong(n());
    }
    double nd() {
        return Double.parseDouble(n());
    }
    static String readNextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
    }
    static int[] readIntArray(int n) {
        int[] a = new int[n];
        for (int idx = 0; idx < n; idx++) {
            a[idx] = ni();
        }
        return a;
    }
    static long[] readLongArray(int n) {
        long[] a = new long[n];
        for (int idx = 0; idx < n; idx++) {
            a[idx] = ni();
        }
        return a;
    }

    public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(Reader in) {
            br = new BufferedReader(in);
        }

        public FastScanner() {
            this(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        // Slightly different from java.util.Scanner.nextLine(),
        // which returns any remaining characters in current line,
        // if any.
        String readNextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        int[] readIntArray(int n) {
            int[] a = new int[n];
            for (int idx = 0; idx < n; idx++) {
                a[idx] = nextInt();
            }
            return a;
        }
    }
}
