There is a $NXM$ grid and every cell of grid has a person or has an obstacle, now a person at $A_{ij}$ can move to $A_{(i-1)j}$, $A_{(i+1)j}$, $A_{i(j-1)}$ and $A_{i(j+1)}$, given that the box is in grid and it does not have an obstacle.

Now, you are given $Q$ queries, In each query you are given two integers $L$ and $R$. You need to find how many person can come to cell $A_{LR}$.

INPUT

First line of input contains two integers $N$ and $M$, $N$ line follows each containing $M$ space separated integers, elements of grid. Next line contain a single integer $Q$ number of queries. $Q$ lines follow each containing two space separated integer $L$ and $R$.

OUTPUT

For each query print number of person who can visit that cell of grid.

CONSTRAINTS

• $1 \le N,M \le 10^3$
• Grid will contain 0 and 1 only 1 means a person and 0 means obstacle