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 cnt = 0 for a in row: if a == 0: cnt += 1 else: res = res*a%md return res, cnt h, w = LI() aa = LLI(h) q = II() ij = LLI1(q) zi = [] zj = [] si = [] sj = [] s = 1 z = 0 for row in aa: cur, cnt = tos(row) zi.append(cnt) z += cnt s = s*cur%md si.append(pow(cur, md-2, md)) for col in zip(*aa): cur, cnt = tos(col) zj.append(cnt) sj.append(pow(cur, md-2, md)) for i, j in ij: if zi[i]+zj[j]-(aa[i][j] == 0) == z: ans = s*si[i]*sj[j]*aa[i][j]%md else: ans = 0 print(ans)