import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')


# 拡張ユークリッド互除法

proc xgcd(a,b:int):(int,int,int)=
  var
    b = b
    x0=1
    y0=0
    x1=0
    y1=1
    q:int
    a = a
  while b!=0:
    (q,a,b) = (a.div(b),b,a.mod(b))
    (x0,x1)=(x1,x0-q*x1)
    (y0,y1)=(y1,y0-q*y1)
  return (a,x0,y0)

# modの逆元
proc modinv(a,m:int):int=
  var (g,x,y)=xgcd(a,m)
  if g!=1:
    return -1
  else:
    return x mod m




proc solve()=
  var
    h = scan()
    w = scan()
    a = newseqwith(h,newseqwith(w,scan()))
    board = newseqwith(h+1,newseqwith(w+1,1))
    q = scan()
    yx = newseqwith(q,(scan(),scan()))
    md = 10^9+7
  
  for y in 1..h:
    for x in 1..w:
      board[y][x] = ((((a[y-1][x-1]*board[y-1][x]).mod(md)*(board[y][x-1]*modinv(board[y-1][x-1],md)).mod(md)).mod(md))+md).mod(md)
  #echo board.join("\n")
  for (y,x) in yx:
    var 
      lower_right = (((board[h][w]*modinv(board[h][x],md)).mod(md)*(modinv(board[y][w],md)*board[y][x]).mod(md)).mod(md)+md).mod(md)
      lower_left = ((board[h][x-1]*modinv(board[y][x-1],md)).mod(md)+md).mod(md)
      upper_right = ((board[y-1][w]*modinv(board[y-1][x],md)).mod(md)+md).mod(md)
      upper_left = board[y-1][x-1]
    echo (((lower_right*lower_left).mod(md)*((upper_right*upper_left).mod(md))).mod(md)+md).mod(md)
  
solve()