#!/usr/bin/env python3
from typing import *

MOD = 1000000007
def solve(h: int, w: int, a: List[List[int]], q: int, r: List[int], c: List[int]) -> List[int]:
    all_prod = 1
    all_zero = 0
    row_prod = [1] * h
    col_prod = [1] * w
    row_zero = [0] * h
    col_zero = [0] * w
    for y in range(h):
        for x in range(w):
            if a[y][x] == 0:
                row_zero[y] += 1
                col_zero[x] += 1
            else:
                row_prod[y] = row_prod[y] * a[y][x] % MOD
                col_prod[x] = col_prod[x] * a[y][x] % MOD
        all_prod = all_prod * row_prod[y] % MOD
        all_zero += row_zero[y]
    ans = []
    for y, x in zip(r, c):
        prod = all_prod * pow(row_prod[y], MOD - 2, MOD) * pow(col_prod[x], MOD - 2, MOD)
        zero = all_zero - row_zero[y] - col_zero[x]
        if a[y][x] == 0:
            zero += 1
        else:
            prod *= a[y][x]
        prod %= MOD
        if zero:
            ans.append(0)
        else:
            ans.append(prod)
    return ans

# generated by online-judge-template-generator v4.4.0 (https://github.com/kmyk/online-judge-template-generator)
def main():
    import sys
    tokens = iter(sys.stdin.read().split())
    H = int(next(tokens))
    W = int(next(tokens))
    A = [[None for _ in range(W)] for _ in range(H)]
    for j in range(H):
        for i in range(W):
            A[j][i] = int(next(tokens))
    Q = int(next(tokens))
    r = [None for _ in range(Q)]
    c = [None for _ in range(Q)]
    for i in range(Q):
        r[i] = int(next(tokens)) - 1
        c[i] = int(next(tokens)) - 1
    assert next(tokens, None) is None
    ans = solve(H, W, A, Q, r, c)
    print(*ans, sep='\n')

if __name__ == '__main__':
    main()