package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	h := getNextInt(scanner)
	w := getNextInt(scanner)
	aa := makeGrid(h, w)
	for i := 0; i < h; i++ {
		for j := 0; j < w; j++ {
			aa[i][j] = mint(getNextInt(scanner))
		}
	}
	lu := makeGrid(h+2, w+2)
	ld := makeGrid(h+2, w+2)
	ru := makeGrid(h+2, w+2)
	rd := makeGrid(h+2, w+2)
	for i := 0; i < h+2; i++ {
		for j := 0; j < w+2; j++ {
			lu[i][j] = 1
			ld[i][j] = 1
			ru[i][j] = 1
			rd[i][j] = 1
		}
	}
	for i := 0; i < h; i++ {
		for j := 0; j < w; j++ {
			lu[i+1][j+1] = aa[i][j]
			ld[i+1][j+1] = aa[i][j]
			ru[i+1][j+1] = aa[i][j]
			rd[i+1][j+1] = aa[i][j]
		}
	}
	for i := 0; i < h+1; i++ {
		for j := 0; j < w; j++ {
			lu[i][j+1].mulAs(lu[i][j])
		}
		for j := w; j > 0; j-- {
			ru[i][j-1].mulAs(ru[i][j])
		}
	}
	for i := h; i > 0; i-- {
		for j := 0; j < w; j++ {
			ld[i][j+1].mulAs(ld[i][j])
		}
		for j := w; j > 0; j-- {
			rd[i][j-1].mulAs(rd[i][j])
		}
	}
	for j := 0; j < w+1; j++ {
		for i := 0; i < h; i++ {
			lu[i+1][j].mulAs(lu[i][j])
		}
		for i := h; i > 0; i-- {
			ld[i-1][j].mulAs(ld[i][j])
		}
	}
	for j := w; j > 0; j-- {
		for i := 0; i < h; i++ {
			ru[i+1][j].mulAs(ru[i][j])
		}
		for i := h; i > 0; i-- {
			rd[i-1][j].mulAs(rd[i][j])
		}
	}

	q := getNextInt(scanner)
	for i := 0; i < q; i++ {
		r := getNextInt(scanner)
		c := getNextInt(scanner)
		fmt.Fprintln(writer, lu[r-1][c-1].mul(ru[r-1][c+1]).mul(ld[r+1][c-1]).mul(rd[r+1][c+1]))
	}
}

func makeGrid(h, w int) [][]mint {
	index := make([][]mint, h, h)
	data := make([]mint, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}

type mint int64

func (mt mint) mod() mint {
	m := mint(1e9 + 7)
	mt %= m
	if mt < 0 {
		return mt + m
	}
	return mt
}
func (mt mint) inv() mint {
	return mt.pow(mint(0).sub(2))
}
func (mt mint) pow(n mint) mint {
	p := mint(1)
	for n > 0 {
		if n&1 == 1 {
			p.mulAs(mt)
		}
		mt.mulAs(mt)
		n >>= 1
	}
	return p
}
func (mt mint) add(x mint) mint {
	return (mt + x).mod()
}
func (mt mint) sub(x mint) mint {
	return (mt - x).mod()
}
func (mt mint) mul(x mint) mint {
	return (mt * x).mod()
}
func (mt mint) div(x mint) mint {
	return mt.mul(x.inv())
}
func (mt *mint) addAs(x mint) *mint {
	*mt = mt.add(x)
	return mt
}
func (mt *mint) subAs(x mint) *mint {
	*mt = mt.sub(x)
	return mt
}
func (mt *mint) mulAs(x mint) *mint {
	*mt = mt.mul(x)
	return mt
}
func (mt *mint) divAs(x mint) *mint {
	*mt = mt.div(x)
	return mt
}