//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;

/*
#include "boost/multiprecision/cpp_int.hpp"
#include "boost/multiprecision/cpp_dec_float.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
*/
 
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define rrep(i,r,l) for(ll i=r;i>=l;i--)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define endl "\n"  //インタラクティブで消す！！！！！！！！！！！！！！！！！！！！！
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
template<class T,class S>
inline bool chmax(T &a, S b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T,class S>
inline bool chmin(T &a, S b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void mod_print(ll k){
    ll P=50000;
    rep(y,1,P){
        ll x=mod(y*k);
        
        if(abs(x)<=P||x+P>=i_7){
            if(x+P>=i_7){
                x-=i_7;
            }
            cout<<x<<"/"<<y<<endl;
            //cout<<setprecision(5)<<(dd)x/(dd)y;
            return;
        }
    }
    cout<<"nun"<<endl;
}
#define all(c) c.begin(),c.end()
typedef vector<ll> vl;
//////////////////////////


ll po(ll i,ll p){
    if(p==0)return 1;
    else{
        i=mod(i);
        if(p==1)return i;
        if(p%2==0)return po(mod(i*i),p/2);
        return mod(i*po(i,p-1));
    }
}
ll bunbo(ll n){
    return po(n,i_5);
}


int main(){fastio
    ll h,w;cin>>h>>w;
    ll a[h][w];
    rep(i,0,h-1)rep(j,0,w-1)cin>>a[i][j];
    ll s[h],t[w];
    rep(i,0,h-1)s[i]=1;
    rep(i,0,w-1)t[i]=1;
    ll sum=1;
    ll zs[h],zt[w];
    ll sz=0;
    rep(i,0,h-1)zs[i]=0;
    rep(i,0,w-1)zt[i]=0;
    rep(i,0,h-1){
        rep(j,0,w-1){
            if(a[i][j]==0){
                zs[i]++;
                zt[j]++;
                sz++;
            }else{
                s[i]=mod(s[i]*a[i][j]);
                t[j]=mod(t[j]*a[i][j]);
                sum=mod(sum*a[i][j]);
            }
        }
    }
   
    ll q;cin>>q;
    while(q--){
        ll r,c;cin>>r>>c;
        ll ans=sum;
        r--;c--;
        ll zero=zs[r]+zt[c];
        if(a[r][c]==0)zero--;
        if(zero!=sz){
            cout<<0<<endl;
           // cout<<zero<<" "<<sz<<endl;
        }else{
            if(a[r][c]!=0)ans=mod(ans*a[r][c]);
            ans=mod(ans*bunbo(s[r]));
            ans=mod(ans*bunbo(t[c]));
            cout<<ans<<endl;
        }
    }
   
    return 0;
}