import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
mod = 10 ** 9 + 7

R = []
for i in range(H):
    acc = 1
    for j in range(W):
        acc *= A[i][j]
        acc %= mod
    R.append(acc)
C = []
for j in range(W):
    acc = 1
    for i in range(H):
        acc *= A[i][j]
        acc %= mod
    C.append(acc)
S = 1
for i in range(H):
    S *= R[i]
    S %= mod

Q = int(input())
for _ in range(Q):
    r, c = map(lambda x: int(x) - 1, input().split())
    print(S * pow(R[r], mod - 2, mod) * pow(C[c], mod - 2, mod) * A[r][c] % mod)