#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
random_device rnd;
mt19937 mt(rnd());
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1000000007;

ll mpow(ll base, ll num)
{
    if (num <= 0)
        return 1;
    ll prev = mpow(base, num / 2);
    if (num % 2 == 0)
    {
        return (prev * prev) % MOD;
    }
    else
    {
        return (((prev * prev) % MOD) * base) % MOD;
    }
}

ll inv(ll num)
{
    return mpow(num, MOD - 2);
}

int main()
{
    ll h, w;
    cin >> h >> w;
    VVL g(h, VL(w, 0));
    VVI zero(h, VI(w, 0));

    int zeronum = 0;
    rep(i, h) rep(j, w)
    {
        cin >> g[i][j];
        if (g[i][j] == 0)
        {
            zero[i][j] = 1;
            g[i][j] = 1;
            zeronum++;
        }
    }
    VI zeroy(h, 0);
    VI zerox(w, 0);

    rep(i, h)
    {
        rep(j, w)
        {
            zeroy[i] += zero[i][j];
            zerox[j] += zero[i][j];
        }
    }
    VVL multi(h + 1, VL(w + 1, 1));

    rep(i, h) multi[i + 1][1] = (multi[i][1] * g[i][0]) % MOD;
    rep(i, w) multi[1][i + 1] = (multi[1][i] * g[0][i]) % MOD;
    rep(i, 1, h)
    {
        rep(j, 1, w)
        {
            //multi[i + 1][j + 1] = mpow(multi[i][j + 1] * multi[i + 1][j], multi[i][j] - 2) * g[i][j];
            multi[i + 1][j + 1] = (((((multi[i][j + 1] * multi[i + 1][j]) % MOD) * inv(multi[i][j])) % MOD) * g[i][j]) % MOD;

            multi[i + 1][j + 1] %= MOD;
        }
    }

    ll total = multi[h][w];
    int q;
    cin >> q;
    rep(i, q)
    {
        int x, y;
        cin >> y >> x;
        int z = zeronum;
        z -= zeroy[y - 1];
        z -= zerox[x - 1];

        z += zero[y - 1][x - 1];
        //cerr << z << endl;
        if (z != 0)
        {
            cout << 0 << endl;
            continue;
        }

        ll tmp = multi[y][w] * inv(multi[y - 1][w]);
        tmp %= MOD;

        tmp *= (multi[h][x] * inv(multi[h][x - 1])) % MOD;
        tmp %= MOD;

        tmp *= inv(g[y - 1][x - 1]);
        tmp %= MOD;

        cout << (total * inv(tmp)) % MOD << endl;
    }

    return 0;
}