#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------
struct mint {
	ll x;
	mint(ll x=0):x(x%mod){}

	bool operator==(const mint a)const{return x==a.x;}
	bool operator!=(const mint a)const{return x!=a.x;}
	bool operator>=(const mint a){return (x >= a.x)? 1: 0;}
	bool operator<(const mint a){return !(*this>=a);}
	bool operator>(const mint a){return (x > a.x)? 1:0;}
	bool operator<=(const mint a){return !(*this>a);}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod-a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res+=a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res-=a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res*=a;
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res/=a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t>>1);
		a *= a;  //2 square
		if (t&1) a *= *this; 
		return a;
	}
	// for prime mod
	mint inv() const {
		return pow(mod-2);
	}
};


int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);

    int h,w; cin >> h >> w;
    vector<vector<ll>> A(h, vector<ll>(w,1));
    vector<mint> H(h,1);
    vector<mint> W(w,1);
    vector<int> Hz(h,0);
    vector<int> Wz(w,0);
    mint ans = mint(1);
    int zeros = 0;
    rep(i,h) {
        rep(j,w) {
            cin >> A[i][j];
            if(A[i][j] != 0) {
                H[i] *= A[i][j];
                W[j] *= A[i][j];
                ans *= A[i][j];
            } else {
                zeros++;
                Hz[i]++;
                Wz[j]++;
            }
        }
    }

    int Q; cin >> Q;
    while(Q--) {
        int r,c; cin >> r >> c; r--; c--;
        int cnt = Hz[r] + Wz[c] - (A[r][c]==0LL? 1: 0);
        if(zeros != cnt) cout << 0 << endl;
        else {
            mint cur = ans / H[r]/W[c] * (A[r][c] != 0?mint(A[r][c]):mint(1));
        cout << cur.x << endl;}
    }
    return 0;
}