#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define REP(i, n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()

ll power(ll x, ll y) {
	if (y==0) return 1;
	else if (y==1) return x%MOD;
	else if (y%2==0) { ll pow=power(x,y/2); return (pow*pow)%MOD; } 
	else { ll pow=power(x,y/2); return ((pow*pow)%MOD)*x%MOD; }
}
ll divid(ll x, ll y) {
	return ((x%MOD)*power(y,MOD-2))%MOD;
}

int main() {
	int h, w; cin >> h >> w;
	VVI a(h,VI(w));
	VI fy(h,1), fx(w,1);
	VI zy(h,0), zx(w,0);
	ll prd=1;
	int zc=0;
	ll aa;
	REP(i,h)REP(j,w){
		cin >> aa;
		a[i][j]=aa;
		if(aa==0){
			zy[i]++;
			zx[j]++;
			zc++;
			continue;
		}
		fy[i]=fy[i]*aa%MOD;
		fx[j]=fx[j]*aa%MOD;
		prd=prd*aa%MOD;
	}
	int q; cin >> q;
	int r, c;
	while(q--){
		cin >> r >> c;
		r--; c--;
		if(zy[r]+zx[c]<zc+(a[r][c]==0))
			cout << 0 << endl;
		else{
			ll ans=prd;
			ans=divid(ans,fy[r]);
			ans=divid(ans,fx[c]);
			if(a[r][c]!=0)
				ans=ans*a[r][c]%MOD;
			cout << ans << endl;
		}
	}
	return 0;
}