#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

void extended_euclid(ll x,ll y,ll *c,ll *a,ll *b){
  ll a0,a1,a2,b0,b1,b2,r0,r1,r2,q;r0=x;r1=y;a0=1;a1=0;b0=0;b1=1;
  while(r1>0){q=r0/r1;r2=r0%r1;a2=a0-q*a1;b2=b0-q*b1;r0=r1;r1=r2;a0=a1;a1=a2;b0=b1;b1=b2;}
  *c=r0;*a=a0;*b=b0;
}

ll get_inv(ll n, ll p){
  ll a,b,c;
  extended_euclid(n,p,&c,&a,&b);
  if(a<p) a+=p;
  return a%p;
}

void Main() {
  ll n,m;
  cin >> n >> m;
  ll a[n][m];
  rep(i,n)rep(j,m) cin >> a[i][j];
  ll x[n],y[m],c[n],d[m];
  fill(x,x+n,1);mem(c);
  fill(y,y+m,1);mem(d);
  rep(i,n)rep(j,m){
    if(a[i][j]) x[i]*=a[i][j],x[i]%=MAX;
    else c[i]++;
  }
  rep(j,m)rep(i,n) {
    if(a[i][j]) y[j]*=a[i][j],y[j]%=MAX;
    else d[j]++;
  }
  ll ans=1,cnt=0;
  rep(i,n)rep(j,m) {
    if(a[i][j])ans*=a[i][j],ans%=MAX;
    else cnt++;
  }
  int T;
  cin >> T;
  while(T--) {
    ll h,w;
    cin >> h >> w;
    h--,w--;
    ll e=cnt-c[h]-d[w];
    if(!a[h][w]) e++;
    if(e) {
      pr(0);
      continue;
    }
    ll z=ans;
    z*=get_inv(x[h],MAX);
    z%=MAX;
    z*=get_inv(y[w]*(a[h][w]?get_inv(a[h][w],MAX)%MAX:1),MAX);
    z%=MAX;
    pr(z);
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}