#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const int MOD=1e9+7;

ll modinv(ll a,ll m){
  ll b=m,u=1,v=0;
  while(b){
    ll t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  u%=m; 
  if(u<0) u+=m;
  return u;
}

int main(){
  ll h,w;
  cin>>h>>w;
  
  ll A[h+1][w+1],Z[h+1][w+1];
  ll x;
  for(int i=1;i<=h;i++){
    for(int j=1;j<=w;j++){
      cin>>x;
      if(x==0){
        A[i][j]=1;
        Z[i][j]=1;
      }
      else{
        A[i][j]=x;
        Z[i][j]=0;
      }
    }
  }
  
  ll s[h+2][w+2];
  rep(i,h+2){
    rep(j,w+2) s[i][j]=0;
  }
  s[1][1]=0;
  for(int i=1;i<h+1;i++){
    for(int j=1;j<w+1;j++) s[i+1][j+1]=s[i+1][j]+s[i][j+1]-s[i][j]+Z[i][j];
  }
  
  ll all=1;
  for(int i=1;i<=h;i++){
    for(int j=1;j<=w;j++) all=(all*A[i][j])%MOD;
  }
  
  vector<ll> B(h+1),C(w+1);
  ll tmp;
  for(int i=1;i<=h;i++){
    for(int j=1;j<=w;j++){
      if(j==1) tmp=A[i][1];
      else tmp=(tmp*A[i][j])%MOD;
    }
    B[i]=modinv(tmp,MOD);
  }
  for(int j=1;j<=w;j++){
    for(int i=1;i<=h;i++){
      if(i==1) tmp=A[1][j];
      else tmp=(tmp*A[i][j])%MOD;
    }
    C[j]=modinv(tmp,MOD);
  }
  
  ll q;
  cin>>q;
  
  ll r,c;
  rep(i,q){
    cin>>r>>c;
    ll a=0;
    a+=s[r][c];
    a+=s[r][w+1]-s[r][c+1];
    a+=s[h+1][c]-s[r+1][c];
    a+=s[h+1][w+1]-s[r+1][w+1]-s[h+1][c+1]+s[r+1][c+1];
    if(a>0) cout<<0<<endl;
    else{
      ll ans=(((all*B[r]%MOD)*C[c]%MOD)*A[r][c])%MOD;
      cout<<ans<<endl;
    }
  }

  return 0;
}