#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
vector<ll> a[100010];
int cnt1[100010], cnt2[100010];
ll p1[100010], p2[100010];
int tot;
ll prod;
int main()
{
	int h, w; cin>>h>>w;
	prod=1;
	for(int i=0; i<h; i++){
		a[i].resize(w);
		for(int j=0; j<w; j++){
			cin>>a[i][j];
			if(a[i][j]!=0) (prod*=a[i][j])%=MOD;
			else tot++;
		}
	}
	for(int i=0; i<h; i++) p1[i]=1;
	for(int j=0; j<w; j++) p2[j]=1;
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			if(a[i][j]==0) cnt1[i]++, cnt2[j]++;
			else (p1[i]*=a[i][j])%=MOD, (p2[j]*=a[i][j])%=MOD;
		}
	}
	int q; cin>>q;
	while(q--){
		int r, c; cin>>r>>c;
		r--; c--;
		int z=tot-cnt1[r]-cnt2[c];
		if(a[r][c]==0) z++;
		if(z==0){
			ll ans=prod*inv(p1[r])%MOD*inv(p2[c])%MOD;
			if(a[r][c]!=0) ans=ans*a[r][c]%MOD;
			cout<<ans<<endl;
		}else{
			cout<<0<<endl;
		}
	}
	return 0;
}