#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

int main(void){
	int h,w;
	cin>>h>>w;
	vector<vector<ll>> v1(h,vector<ll>(w));
	vector<ll> row(h),column(w),rz(h),cz(w);
	ll sum = 1,allz=0;
	for(int i=0;i<h;i++){
		for(int j=0;j<w;j++){
			cin>>v1[i][j];
			if(v1[i][j]!=0)sum = (sum*v1[i][j])%N;
			else allz++;
		}
	}
	if(allz==h*w)sum=0;
	for(int i=0;i<h;i++){
		row[i]=1;
		for(int j=0;j<w;j++){
			if(v1[i][j]!=0)row[i] = (row[i]*v1[i][j])%N;
			else rz[i]++;
		}
		if(rz[i]==w)row[i]=0;
	}
	for(int i=0;i<w;i++){
		column[i]=1;
		for(int j=0;j<h;j++){
			if(v1[j][i]!=0)column[i] = (column[i]*v1[j][i])%N;
			else cz[i]++;
		}
		if(cz[i]==h)column[i]=0;
	}
	int Q;
	cin>>Q;
	for(int i=0;i<Q;i++){
		ll r,c;
		cin>>r>>c;
		r--;
		c--;
		ll R = row[r];
		ll C = column[c];
		ll V = v1[r][c];
		if(allz!=0){
			if(V!=0){
				if(rz[r]+cz[c]==allz)cout<<sum<<endl;
				else{
					if(rz[r]+cz[c]<allz)cout<<0<<endl;
				}
			}
			else{
				if(rz[r]+cz[c]-1==allz)cout<<sum<<endl;
				else{
					if(rz[r]+cz[c]-1<allz)cout<<0<<endl;
				}
			}
		}
		else{
			R = inv(R,N-2);
			C = inv(C,N-2);
			ll ans = (((((sum*R)%N)*C)%N)*V)%N;
			cout<<ans<<endl;
		}
	}
	return 0;
}