/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
    ll power(ll x, ll n){
        if(n == 0) return 1LL;
        ll res = power(x * x % MOD, n/2);
        if(n % 2 == 1) res = res * x % MOD;
        return res;
    }

void solve(){
    ll H,W;
    cin >> H >> W;
    vector< vector<ll> > A(H+1, vector<ll>(W+1));
    rep(i,0,H){
        rep(j,0,W){
            cin >> A[i][j];
        }
    }
    ll mul = 1;
    rep(i,0,H){
        rep(j,0,W){
            if(A[i][j] != 0){
                mul *= A[i][j];
                mul %= MOD;
            }
        }
    }
    ll tate[100010], yoko[100010];
    rep(i,0,H){
        ll res = 1;
        rep(j,0,W){
            if(A[i][j] != 0){
                res *= A[i][j];
                res %= MOD;
            }
        }
        tate[i] = res;
    }
    rep(j,0,W){
        ll res = 1;
        rep(i,0,H){
            if(A[i][j] != 0){
                res *= A[i][j];
                res %= MOD;
            }
        }
        yoko[j] = res;
    }
    vector< vector<ll> > sum(H+2, vector<ll>(W+2, 0));
    ll n1[100010] = {}, n2[100010] = {};
    ll zero_cnt = 0;
    rep(i,0,H){
        rep(j,0,W){
            if(A[i][j] == 0){
                n1[i]++;
                n2[j]++;
                zero_cnt++;
            }
        }
    }

    ll Q;
    cin >> Q;
    while(Q--){
        ll r,c;
        cin >> r >> c;
        r--; c--;
        ll num = n1[r] + n2[c];
        if(A[r][c] == 0) num--;
        if(num != zero_cnt){
            print(0);
        }else{
            ll ans = mul * power(tate[r], MOD-2) % MOD * power(yoko[c], MOD-2) % MOD;
            if(A[r][c] != 0){
                ans *= A[r][c];
                ans %= MOD;
            }
            print(ans);
        }

    }


}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}