from collections import defaultdict
from collections import Counter 
def solve():
  mod = 10**9+7
  H, W = map(int, input().split())
  h_prod = [1]*H
  w_prod = [1]*W
  A = [list(map(int, input().split())) for _ in range(H)]
  h_zero = [0]*H
  w_zero = [0]*W
  zero_cnt = 0
  for i in range(H):
    for j in range(W):
      if A[i][j]==0:
        h_zero[i] += 1
        w_zero[j] += 1
        zero_cnt += 1
        continue
      h_prod[i] *= A[i][j]
      w_prod[j] *= A[i][j]
      h_prod[i] %= mod
      w_prod[j] %= mod
  hl,wl = len(h_zero),len(w_zero)
  Q = int(input())
  total = 1
  for i in range(H):
    total *= h_prod[i]
    total %= mod
  ans = [total]*Q
  for i in range(Q):
    r,c = map(int, input().split())
    r -= 1
    c -= 1
    if h_zero[r]+w_zero[c]-(A[r][c]==0)<zero_cnt:
      ans[i] = 0
      continue
    ans[i] *= pow(h_prod[r]*w_prod[c],mod-2,mod)
    if A[r][c]!=0:
      ans[i] *= A[r][c]
    ans[i] %= mod
  return ans
print(*solve(),sep='\n')