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.math.*;
import java.util.*;

public class Main {
    static FastScanner in;
    static final int MOD = 1000000007;

    public static void main(String[] args) throws IOException {
        //        System.setOut(new PrintStream(new BufferedOutputStream(new FileOutputStream("output.txt")), true));
        //        Scanner in = new Scanner(new File("input.txt"));
        //        Scanner in = new Scanner(System.in);
        in = new FastScanner(System.in);
        PrintWriter writer = new PrintWriter(System.out);
        //        in = new FastScanner("input.txt");
        int n = in.nextInt();
        int m = in.nextInt();
        int k = in.nextInt();
        char museum[][] = new char[n][m];
        int out[][] = new int[n][m];
        for (int i = 0; i < n; i++) {
            museum[i] = in.next().toCharArray();
        }
        dfsLoop(museum, out, n, m);
        while (k-- > 0) {
            int x = in.nextInt();
            int y = in.nextInt();
            writer.println(out[x - 1][y - 1]);
        }
        writer.close();
    }

    static void dfsLoop(char[][] museum, int out[][], int n, int m) {
        boolean isVisited[][] = new boolean[n][m];
        Stack<Pair> st = new Stack<Pair>();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (!isVisited[i][j] && museum[i][j] == '.') {
                    int con = 0;
                    Queue<Pair> q = new LinkedList<Pair>();
                    Pair start = new Pair(i, j);
                    st.add(start);
                    isVisited[i][j] = true;
                    while (!st.isEmpty()) {
                        Pair u = st.pop();
                        q.add(u);
                        int x = u.first;
                        int y = u.second;
                        for (int dx = -1; dx <= 1; dx++) {
                            for (int dy = -1; dy <= 1; dy++) {
                                if (dx != dy && dx * dy == 0) {
                                    int xx = x + dx;
                                    int yy = y + dy;
                                    if (xx >= 0 && xx < n && yy >= 0 && yy < m) {
                                        if (!isVisited[xx][yy] && museum[xx][yy] == '.') {
                                            st.add(new Pair(xx, yy));
                                            isVisited[xx][yy] = true;
                                        }
                                        if (museum[xx][yy] == '*') {
                                            con++;
                                        }
                                    }
                                }
                            }
                        }
                    }
                    while (!q.isEmpty()) {
                        Pair u = q.poll();
                        out[u.first][u.second] = con;
                    }
                }
            }
        }
    }
}

class Pair {
    public int first; //first member of pair
    public int second; //second member of pair

    public Pair(int first, int second) {
        this.first = first;
        this.second = second;
    }

    public Pair() {

    }
}

class FastScanner {

    BufferedReader br;
    StringTokenizer tokenizer;

    FastScanner(String fileName) throws FileNotFoundException {
        this(new FileInputStream(new File(fileName)));
    }

    FastScanner(InputStream is) {
        br = new BufferedReader(new InputStreamReader(is));
    }

    String nextLine() throws IOException {
        tokenizer = null;
        return br.readLine();
    }

    String next() throws IOException {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            String line = br.readLine();
            if (line == null) {
                return null;
            }
            tokenizer = new StringTokenizer(line);
        }
        return tokenizer.nextToken();
    }

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

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

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

    char nextChar() throws IOException {
        return next().charAt(0);
    }
}