#### Start

2020-02-17 04:15 AKST

## Kattis Set 06

#### End

2020-03-02 00:30 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -284 days 13:39:17

332:15:00

0:00:00

# Problem LJabuke

It is often heard that the apple doesn’t fall far from the tree. But is that really so?

The National Statistics Department has tracked the falling of apples in a fruit garden for $G$ consecutive years. The fruit garden can be represented as a matrix with dimensions $R \times S$. Each field of the matrix can contain more than one apple tree.

Interestingly enough, each year there was exactly one apple fall, so the Department decided to write down $G$ pairs of numbers $(r_ i, s_ i)$ that denote the row and column of the location where the apple fell during the $i$-th year. Moreover, by next year, a new tree grew at that location.

Your task is to determine the squared distance between the nearest tree and the apple that fell, measured in unit fields of the matrix (we assume it is that tree from which the apple fell).

The distance between fields $(r_1, s_1)$ and $(r_2, s_2)$ in the matrix are calculated as

\begin{equation*} d((r_1, s_1),(r_2, s_2)) = \sqrt {(r_1-r_2)^2 + (s_1-s_2)^2} \end{equation*}

## Input

The first line of input contains two integers, $R$ and $S$ ($1 \leq R, S \leq 500$), the number of rows and columns of the matrix.

Each of the following $R$ lines contains $S$ characters ’x’ or ’.’. The character ’.’ denotes an empty field, and the character ’x’ denotes a field with at least one tree.

The fruit garden will initially contain at least one tree.

After that, an integer $G$ ($1 \leq G \leq 10^5$) follows, the number of years the fruit garden has been under observation.

Each of the following $G$ lines describes the falls of the apples. Each line contains a pair of space-separated integers $r_ i$, $s_ i$ that denote the row and column of the location where the apple fell in the $i$-th year ($1 \leq r_ i \leq R$, $1 \leq s_ i \leq S$).

## Output

Output $G$ numbers, the required squared distances from the task, each in its own line.

Sample Input 1 Sample Output 1
3 3
x..
...
...
3
1 3
1 1
3 2

4
0
5

Sample Input 2 Sample Output 2
5 5
..x..
....x
.....
.....
.....
4
3 1
5 3
4 5
3 5

8
8
4
1