mod = 10**9 + 7

h, w = map(int, input().split())
a = [list(map(int, input().split())) for i in range(h)]

product_all = 1
product_row = [1] * h
product_column = [1] * w
zero_all = 0
zero_row = [0] * h
zero_column = [0] * w
for i in range(h):
    for j in range(w):
        if a[i][j]:
            product_all *= a[i][j]
            product_all %= mod
            product_row[i] *= a[i][j]
            product_row[i] %= mod
            product_column[j] *= a[i][j]
            product_column[j] %= mod
        else:
            zero_all += 1
            zero_row[i] += 1
            zero_column[j] += 1

q = int(input())
for i in range(q):
    r, c = map(int, input().split())
    zero_point = 0
    if a[r - 1][c - 1] == 0:
        zero_point += 1
    assert(zero_all - zero_row[r - 1] - zero_column[c - 1] + zero_point >= 0)
    if zero_all - zero_row[r - 1] - zero_column[c - 1] + zero_point == 0:
        print(product_all * pow(product_row[r - 1], mod - 2, mod) * pow(product_column[c - 1], mod - 2, mod) * a[r - 1][c - 1] % mod)
    else:
        print(0)