#include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;

//for(i=0; i<N; i++) cin >> a[i];

ll mop(ll x, ll n) {
  ll res=1;
  while(n>0) {
    if(n&1) (res*=x)%=MOD;
    (x*=x)%=MOD;
    n>>=1;
  }
  return res;
}

int main(void) {
  ll i, j, k;
  
  ll H, W;
  cin >> H >> W;
  ll a[H+10][W+10];
  ll zh[MAX]={}, zw[MAX]={};
  ll mh[MAX], mw[MAX];
  ll M=1;
  ll Z=0;
  
  for(i=0; i<H; i++) mh[i]=1;
  for(i=0; i<W; i++) mw[i]=1;
  
  for(i=0; i<H; i++) {
    for(j=0; j<W; j++) {
      cin >> a[i][j];
      if(a[i][j]==0) {
        Z++;
        zh[i]++;
        zw[j]++;
      }else {
        (M*=a[i][j])%=MOD;
        (mh[i]*=a[i][j])%=MOD;
        (mw[j]*=a[i][j])%=MOD;
      }
    }
  }
  
  
  ll Q;
  cin >> Q;
  for(ll _=0; _<Q; _++) {
    ll r, c;
    cin >> r >> c;
    r--; c--;
    
    ll z=zh[r]+zw[c]-(a[r][c]==0);
    if(z==Z) {
      pt(M*a[r][c]%MOD*mop(mh[r], MOD-2)%MOD*mop(mw[c], MOD-2)%MOD);
    }else {
      pt(0);
    }
    
    
    
  }
  
  
  
  
  
  
}