#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int H,W;
	cin>>H>>W;
	vector<vector<ll>> A(H,vector<ll>(W));
	vector<int> B(H),C(W);
	vector<ll> p(H,1),q(W,1);
	ll ans=1,S=0;
	rep(i,H) rep(j,W){
		cin>>A[i][j];
		if(A[i][j]==0){
			B[i]++;
			C[j]++;
			S++;
		}
		else{
			p[i]=(p[i]*A[i][j])%mod;
			q[j]=(q[j]*A[i][j])%mod;
			ans=(ans*A[i][j])%mod;
		}
	}
	int Q;
	cin>>Q;
	rep(i,Q){
		int r,c;
		cin>>r>>c; 
		r--,c--;
		ll tmp=(p[r]*q[c])%mod;
		ll x=(ans*A[r][c])%mod;
		x=(x*jyo(tmp,mod-2,mod))%mod;
		ll J=B[r]+C[c];
		if(A[r][c]==0) J--;
		if(J==S){
			cout<<x<<"\n";
		}else cout<<"0\n";
	}
}