#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000002

int main(){

	int H,W;
	cin>>H>>W;
	
	vector<vector<int>> A(H,vector<int>(W));
	
	for(int i=0;i<H;i++){
		for(int j=0;j<W;j++){
			scanf("%d",&A[i][j]);
		}
	}
	if(H>W){
		vector<vector<int>> B(W,vector<int>(H));
		for(int i=0;i<H;i++){
			for(int j=0;j<W;j++){
				B[j][i] = A[i][j];
			}
		}
		A = B;
	}
	
	vector<vector<int>> Sl = A,Sr = A;
	
	for(int i=0;i<Sl.size();i++){
		for(int j=1;j<Sl[i].size();j++){
			Sl[i][j] = mod(Sl[i][j] * Sl[i][j-1]);
		}
		for(int j=Sr[i].size()-2;j>=0;j--){
			Sr[i][j] = mod(Sr[i][j] * Sr[i][j+1]);
		}
	}
	
	int Q;
	cin>>Q;
	
	for(int i=0;i<Q;i++){
		int r,c;
		scanf("%d %d",&r,&c);
		r--;c--;
		if(H>W)swap(r,c);
		int ans = 1;
		for(int j=0;j<A.size();j++){
			if(j==r)continue;
			if(c!=0)ans = mod(ans * Sl[j][c-1]);
			if(c+1!=A[j].size())ans = mod(ans * Sr[j][c+1]);
		}
		printf("%d\n",ans);
	}
	
	

	return 0;
}