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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}

const ll MOD = 1000000007;
struct mint {
  ll x;
  mint(ll x=0):x((x%MOD+MOD)%MOD){}
  mint& operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}
  mint& operator-=(const mint a) {if ((x += MOD-a.x) >= MOD) x -= MOD;return *this;}
  mint& operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}
  mint operator+(const mint a) const {mint res(*this);return res+=a;}
  mint operator-(const mint a) const {mint res(*this);return res-=a;}
  mint operator*(const mint a) const {mint res(*this);return res*=a;}
  mint pow(ll b) const {
    mint res(1), a(*this);
    while (b) {
      if (b & 1) res *= a;
      a *= a;
      b >>= 1;
    }
    return res;
  }
  // for prime MOD
  mint inv() const {return pow(MOD-2);}
  mint& operator/=(const mint a) {return (*this) *= a.inv();}
  mint operator/(const mint a) const {mint res(*this);return res/=a;}
};
ostream& operator<<(ostream& os, const mint& a) {os << a.x; return os;}


int main2() {
  int H = nextLong();
  int W = nextLong();
  vector< vector<mint> > t(H, vector<mint>(W));
  REP(i, H) REP(j, W) t[i][j] = nextLong();

  vector<mint> rp(H), cp(W);
  vector<int> rz(H), cz(W);
  REP(i, H) {
    mint x = 1;
    int zero = 0;
    REP(j, W) if (t[i][j].x != 0) x *= t[i][j]; else zero++;
    rp[i] = x;
    rz[i] = zero;
  }
  REP(j, W) {
    mint x = 1;
    int zero = 0;
    REP(i, H) if (t[i][j].x != 0) x *= t[i][j]; else zero++;
    cp[j] = x;
    cz[j] = zero;
  }
  mint all = 1;
  int all_z = 0;
  REP(i, H) REP(j, W) if (t[i][j].x != 0) all *= t[i][j]; else all_z++;

  int Q = nextLong();
  while (Q--) {
    int r = nextLong() - 1;
    int c = nextLong() - 1;

    int z = all_z - rz[r] - cz[c] + (t[r][c].x == 0 ? 1 : 0);
    mint ans = 0;
    if (z == 0) {
      ans = all / rp[r] / cp[c] * t[r][c];
    }
    cout << ans << '\n';
  }
  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}