fileprivate struct Scanner {
    private var elements = [String]()
    private var index = 0
    
    mutating func peek() -> String {
        while elements.count == index {
            elements = readLine()!.split(separator: " ").map(String.init)
            index = 0
        }
        return elements[index]
    }
    
    mutating func next() -> String {
        let value = peek()
        index += 1
        return value
    }
    
    mutating func nextInt() -> Int {
        return Int(next())!
    }
    
    mutating func nextDouble() -> Double {
        return Double(next())!
    }
}

fileprivate let MOD = 1000000007

fileprivate struct Zn {
    let n: Int
    
    init(_ n: Int) {
        self.n = n
    }
    
    static func + (lhs: Self, rhs: Self) -> Self {
        let n = lhs.n + rhs.n
        return Zn(n < MOD ? n : n - MOD)
    }
    
    static func - (lhs: Self, rhs: Self) -> Self {
        let n = lhs.n - rhs.n
        return Zn(n >= 0 ? n : n + MOD)
    }
    
    static func * (lhs: Self, rhs: Self) -> Self {
        Zn((lhs.n * rhs.n) % MOD)
    }
    
    static func += (lhs: inout Self, rhs: Self) {
        lhs = lhs + rhs
    }
    
    static func -= (lhs: inout Self, rhs: Self) {
        lhs = lhs - rhs
    }
    
    static func *= (lhs: inout Self, rhs: Self) {
        lhs = lhs * rhs
    }
    
    func pow(_ n: Int) -> Self {
        if n == 0 {
            return Zn(1)
        } else if n % 2 == 1 {
            return self * self.pow(n - 1)
        } else {
            return (self * self).pow(n / 2)
        }
    }
    
    var inverse: Self {
        self.pow(MOD - 2)
    }
}

fileprivate struct Array2D<Element> {
    let n1: Int
    let n2: Int
    private var elements: [Element]
    
    init(repeating: Element, _ n1: Int, _ n2: Int) {
        self.n1 = n1
        self.n2 = n2
        self.elements = [Element](repeating: repeating, count: n1 * n2)
    }
    
    subscript(i: Int, j: Int) -> Element {
        get {
            elements[i * n2 + j]
        }
        set {
            elements[i * n2 + j] = newValue
        }
    }
}


func main() {
    var scanner = Scanner()
    
    let H = scanner.nextInt()
    let W = scanner.nextInt()
    
    var A = Array2D(repeating: 0, H, W)
    for i in 0 ..< H {
        for j in 0 ..< W {
            A[i, j] = scanner.nextInt()
        }
    }
    
    let row = (0 ..< H).map { i in
        (0 ..< W).map { j in A[i, j] == 0 ? Zn(1) : Zn(A[i, j]) }.reduce(Zn(1), *)
    }
    let col = (0 ..< W).map { j in
        (0 ..< H).map { i in A[i, j] == 0 ? Zn(1) : Zn(A[i, j]) }.reduce(Zn(1), *)
    }
    let total = (0 ..< H).map { i in
        (0 ..< W).map { j in A[i, j] == 0 ? Zn(1) : Zn(A[i, j]) }.reduce(Zn(1), *)
    }.reduce(Zn(1), *)
    
    let zeroRow = (0 ..< H).map { i in
        (0 ..< W).map { j in A[i, j] == 0 ? 1 : 0 }.reduce(0, +)
    }
    let zeroCol = (0 ..< W).map { j in
        (0 ..< H).map { i in A[i, j] == 0 ? 1 : 0 }.reduce(0, +)
    }
    let zeroTotal = (0 ..< H).map { i in
        (0 ..< W).map { j in A[i, j] == 0 ? 1 : 0 }.reduce(0, +)
    }.reduce(0, +)
    
    let Q = scanner.nextInt()
    for _ in 0 ..< Q {
        let y = scanner.nextInt() - 1
        let x = scanner.nextInt() - 1
        if zeroTotal - zeroRow[y] - zeroCol[x] + (A[y, x] == 0 ? 1 : 0) == 0 {
            let answer = total * row[y].inverse * col[x].inverse * Zn(A[y, x] == 0 ? 1 : A[y, x])
            print(answer.n)
        } else {
            print(0)
        }
    }
}

main()