#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T> T mod_pow(T x, T n, const T &p)
{
	T ret = 1;
	while (n > 0)
	{
		if (n & 1) (ret *= x) %= p;
		(x *= x) %= p;
		n >>= 1;
	}
	return ret;
}

const ll MOD = 1e9+7;

int main()
{
	int h,w;
	cin >> h >> w;
	vector<vector<ll>> A(h,vector<ll>(w)),ans(h,vector<ll>(w));
	ll cnt0all = 0;
	ll all = 1;
	for(int i = 0;i<h;i++)
	{
		for(int j =0;j<w;j++)
		{
			cin >> A[i][j];
			all = all*A[i][j]%MOD;
			if(A[i][j]==0)cnt0all++;
		}
	}

	vector<ll> row(h,1),col(w,1),row0(h,0),col0(w,0);
	for(int i = 0;i<h;i++)for(int j = 0;j<w;j++)
	{
		
		if(A[i][j]==0)
		{
			row0[i]++;
			continue;
		}
		row[i] = row[i]*mod_pow(A[i][j],MOD-2,MOD)%MOD;
	}
	for(int i = 0;i<h;i++)for(int j = 0;j<w;j++)
	{
		
		if(A[i][j]==0)
		{
			col0[j]++;
			continue;
		}
		col[j] = col[j]*mod_pow(A[i][j],MOD-2,MOD)%MOD;
	}
	vector<bool> is0r(h),is0l(w);
	for(int i = 0;i<h;i++)
	{
		for(int j = 0;j<w;j++)
			if(A[i][j]==0)is0l[i]=is0r[j] = true;
	}
	int q;
	cin >> q;
	while(q--)
	{
		int now0 = cnt0all;
		ll r,c;
		cin >>r >> c;
		r--;c--;
		now0 -= row0[r] + col0[c] - (A[r][c]==0);
		if(now0>0)
		{
			cout<<0<<endl;
			continue;
		}
		ll a = 1;
		a = a*row[r]%MOD;
		a = a*col[c]%MOD;
		a = a*A[r][c]%MOD;
		a = a*all%MOD;
		cout << a << endl;
	}


}