Igor is in the museum and he wants to see as many pictures as possible.

Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked with '*'. Every two adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture.

At the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one.

For several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture he can see.

Input

First line of the input contains three integers n, m and k (3 ≤ n, m ≤ 1000, 1 ≤ k ≤ min(n·m, 100 000)) — the museum dimensions and the number of starting positions to process.

Each of the next n lines contains m symbols '.', '*' — the description of the museum. It is guaranteed that all border cells are impassable, so Igor can't go out from the museum.

Each of the last k lines contains two integers x and y (1 ≤ x ≤ n, 1 ≤ y ≤ m) — the row and the column of one of Igor's starting positions respectively. Rows are numbered from top to bottom, columns — from left to right. It is guaranteed that all starting positions are empty cells.

Output

Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.

Examples

Input

5 6 3
******
*..*.*
******
*....*
******
2 2
2 5
4 3


Output

6
4
10


Input

4 4 1
****
*..*
*.**
****
3 2


Output

8
import java.io.*;
import java.util.*;

public class D2 {
    private static class Point {
        int x, y;

        public Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }


    private final static int ANSWER_IN_PROGRESS = -1;

    private static int addToQueueIfNeeded(Queue<Point> points, char[][] map, int[][] answer, int x, int y) {
        if (map[y][x] == '*') {
//            System.out.println((x + 1) + " " + (y + 1));
            return 1;
        } else {
            if (answer[y][x] != ANSWER_IN_PROGRESS) {
                answer[y][x] = ANSWER_IN_PROGRESS;
                points.add(new Point(x, y));
            }
            return 0;
        }
    }

    private static void bfs(char[][] map, int[][] answer, int x, int y) {
//        System.out.println("---");
        List<Point> handledPoints = new ArrayList<>();
        Queue<Point> points = new ArrayDeque<>();
        if (map[y][x] == '*')
            return;

        points.add(new Point(x, y));
        int val = 0;

        while (!points.isEmpty()) {
            Point point = points.poll();
            handledPoints.add(point);

            int px = point.x;
            int py = point.y;
            answer[py][px] = ANSWER_IN_PROGRESS;
//            System.out.println("> " + (px + 1) + " " + (py + 1));

            val += addToQueueIfNeeded(points, map, answer, px + 1, py);
            val += addToQueueIfNeeded(points, map, answer, px, py + 1);
            val += addToQueueIfNeeded(points, map, answer, px - 1, py);
            val += addToQueueIfNeeded(points, map, answer, px, py - 1);
        }

        for (Point handledPoint : handledPoints) {
//            System.out.println("SET " + (handledPoint.x + 1) + " " + (handledPoint.y + 1));
            answer[handledPoint.y][handledPoint.x] = val;
        }
    }

    public static void main(String[] args) throws IOException {
        try (FastScanner s = new FastScanner(System.in)) {
            PrintStream out = System.out;

            int n, m, k;
            n = s.nextInt();
            m = s.nextInt();
            k = s.nextInt();
            char[][] map = new char[n][];
            for (int i = 0; i < n; i++)
                map[i] = s.nextString().toCharArray();

            int[][] answer = new int[n][m];

            for (int x = 0; x < m; x++)
                for (int y = 0; y < n; y++) {
                    if (answer[y][x] == 0) {
                        bfs(map, answer, x, y);
                    }
                }

            for (int i = 0; i < k; i++) {
                int y = s.nextInt() - 1;
                int x = s.nextInt() - 1;
//                System.out.println("REQ " + (x + 1) + " " + (y + 1));

                out.println(answer[y][x]);
            }
        }
    }

    static class FastScanner implements AutoCloseable {
        private String line;
        private StringTokenizer tokenizer;
        private BufferedReader reader;

        public FastScanner(InputStream is) throws FileNotFoundException {
            reader = new BufferedReader(new InputStreamReader(is));
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(nextString());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(nextString());
        }

        public String nextString() throws IOException {
            if (line == null || !tokenizer.hasMoreTokens()) {
                line = reader.readLine();
                tokenizer = new StringTokenizer(line);
            } else {
                return tokenizer.nextToken();
            }
            return nextString();
        }

        @Override
        public void close() throws IOException {
            reader.close();
        }
    }
}
