import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for k in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for k in range(c)] for k in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10

def div(x, y, MOD): return x * pow(y, MOD-2, MOD) % MOD

H, W = MAP()
grid = list2d(H+2 ,W+2, 1)
for i in range(1, H+1):
    grid[i] = [1] + LIST() + [1]

for i in range(H+2):
    for j in range(W+1):
        grid[i][j+1] *= grid[i][j]
        grid[i][j+1] %= MOD
for j in range(W+2):
    for i in range(H+1):
        grid[i+1][j] *= grid[i][j]
        grid[i+1][j] %= MOD

Q = INT()
for _ in range(Q):
    r, c = MAP()

    rd = div(grid[H+1][W+1] * grid[r][c], grid[H+1][c] * grid[r][W+1], MOD)
    ru = div(grid[r-1][W+1], grid[r-1][c], MOD)
    ld = div(grid[H+1][c-1], grid[r][c-1], MOD)
    lu = grid[r-1][c-1]
    res = 1
    if rd:
        res *= rd
    if ru:
        res *= ru
    if ld:
        res *= ld
    if lu:
        res *= lu
    res %= MOD
    # res = rd * ru * ld * lu % MOD
    print(res)