#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if (p != -1)
	{
		x %= p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}

    Modint &operator+=(const Modint &p){
			if((x+=p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator-=(const Modint &p){
			if((x+=mod-p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator*=(const Modint &p){
			x = (1LL * x * p.x) % mod;
			return *this;
		}

		Modint &operator/=(const Modint &p){
			*this *= p.inverse();
			return *this;
		}

		Modint operator-() const { return Modint(-x); }
		Modint operator+(const Modint &p) const{
			return Modint(*this) += p;
		}
		Modint operator-(const Modint &p) const{
			return Modint(*this) -= p;
		}
		Modint operator*(const Modint &p) const{
			return Modint(*this) *= p;
		}
		Modint operator/(const Modint &p) const{
			return Modint(*this) /= p;
		}

		bool operator==(const Modint &p) const { return x == p.x; }
		bool operator!=(const Modint &p) const{return x != p.x;}

		Modint inverse() const{//非再帰拡張ユークリッド
			int a = x, b = mod, u = 1, v = 0;
			while(b>0){
				int t = a / b;
				swap(a -= t * b, b);
				swap(u -= t * v, v);
			}
			return Modint(u);
		}

		Modint pow(int64_t n) const{//繰り返し二乗法
			Modint ret(1), mul(x);
			while(n>0){
				if(n&1)
					ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return ret;
		}

		friend ostream &operator<<(ostream &os,const Modint &p){
			return os << p.x;
		}
};

using modint = Modint<mod>;
using modint2= Modint<mod_998244353>;

template<typename T>
struct Sum_2D{
  vector<vector<T>>cul;
  bool flag;
  Sum_2D(int h,int w):cul(h+1,vector<T>(w+1)){
    flag=false;
  }

  void add(int x,int y,T val){//0インデックス
    ++x;++y;
    if(x>=cul.size()||y>=cul[0].size())return;
    cul[x][y]+=val;
  }

  void build(){
    flag=true;
    for(int i=1;i<cul.size();++i){
      for(int j=1;j<cul[i].size();++j){
        cul[i][j]+=cul[i][j-1]+cul[i-1][j]-cul[i-1][j-1];
      }
    }
  }

  T query(int lb_x,int lb_y,int ub_x,int ub_y){
    //lb_x,lb_y:左下(含む),ub_x,ub_y:右上(含まない)
    //0インデックスに直す
    assert(flag==true);
    return cul[ub_x][ub_y]-cul[ub_x][lb_y]-cul[lb_x][ub_y]+cul[lb_x][lb_y];
  }
};
void solve()
{	
	int h,w;
	cin>>h>>w;
	vector<vector<ll>>a(h,vector<ll>(w));
	rep(i,h)rep(j,w)cin>>a[i][j];
	vector<modint>r(h,1),c(w,1);
	// vector<vector<int>>sum(h+1,vector<int>(w+1));
	Sum_2D<int>sum(h,w);
	rep(i,h){
		rep(j,w){
			if(a[i][j])r[i]*=a[i][j];
		}
	}
	rep(i,w){
		rep(j,h){
			if(a[j][i])c[i]*=a[j][i];
		}
	}
	rep(i,h){
		rep(j,w){
			// sum[i+1][j+1]=sum[i+1][j]+sum[i][j+1]-sum[i][j]+(a[i][j]==0);
			sum.add(i,j,a[i][j]==0);
		}
	}
	sum.build();
	modint res=1;
	rep(i,h)rep(j,w)if(a[i][j])res*=a[i][j];

	int q;
	cin>>q;
	while(q--){
		int x,y;
		cin>>x>>y;
		x--;y--;
		modint ans=res;
		// int lu=sum[x][y]-sum[x][0]-sum[0][y]+sum[0][0];
		// int ru=sum[h][y]+sum[x+1][0]-sum[x+1][y]-sum[h][0];
		// int ld=sum[x][w]+sum[0][y+1]-sum[x][y+1]-sum[0][w];
		// int rd=sum[h][w]+sum[x+1][y+1]-sum[h][y+1]-sum[x+1][w];
		int lu=sum.query(0,0,x,y);
		int ru=sum.query(0,y+1,x,w);
		int ld=sum.query(x+1,0,h,y);
		int rd=sum.query(x+1,y+1,h,w);
		if(lu+ru+ld+rd==0){
			ans/=r[x];
			ans/=c[y];
			ans*=a[x][y];
		}else{
			ans=0;
		}
		cout<<ans<<"\n";
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}