using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (h, w) = (c[0], c[1]);
        var a = NArr(h);
        var q = NN;
        var query = NArr(q);
        var mod = 1_000_000_007;
        var hlist = Enumerable.Repeat(1L, h).ToArray();
        var wlist = Enumerable.Repeat(1L, w).ToArray();
        var all = 1L;
        for (var i = 0; i < h; ++i) for (var j = 0; j < w; ++j)
            {
                hlist[i] = hlist[i] * a[i][j] % mod;
                wlist[j] = wlist[j] * a[i][j] % mod;
                all = all * a[i][j] % mod;
            }
        for (var i = 0; i < h; ++i) hlist[i] = Exp(hlist[i], mod - 2, mod);
        for (var i = 0; i < w; ++i) wlist[i] = Exp(wlist[i], mod - 2, mod);
        var ans = new long[q];
        for (var i = 0; i < q; ++i)
        {
            var x = query[i][0] - 1;
            var y = query[i][1] - 1;
            ans[i] = all * hlist[x] % mod * wlist[y] % mod * a[x][y] % mod;
        }
        WriteLine(string.Join("\n", ans));
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}