import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

def tos(row):
    res = 1
    for a in row:
        res = res*a%md
    return res

h, w = LI()
aa = LLI(h)
zi, zj = set(), set()
for i in range(h):
    for j in range(w):
        if aa[i][j] == 0:
            zi.add(i)
            zj.add(j)

si = []
sj = []
s = 1
for row in aa:
    cur = tos(row)
    s = s*cur%md
    si.append(pow(cur, md-2, md))
for col in zip(*aa):
    sj.append(pow(tos(col), md-2, md))
q = II()
if len(zi) > 1 or len(zj) > 1:
    for _ in range(q): print(0)
    exit()
for _ in range(q):
    i, j = LI1()
    ans = s*si[i]*sj[j]*aa[i][j]%md
    if zi and i not in zi: ans = 0
    if zj and j not in zj: ans = 0
    print(ans)