#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

static const long long mod = 1000000007;
struct mint {
  long long x;
  mint(ll x = 0):x(x%mod) {}
  mint& operator+=(const mint a) {
    (x += a.x) %= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    (x += mod-a.x) %= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint ret(*this);
    return ret += a;
  }
  mint operator-(const mint a) const {
    mint ret(*this);
    return ret -= a;
  }
  mint operator*(const mint a) const {
    mint ret(*this);
    return ret *= a;
  }
  mint pow(ll t) const {
    if(t==0) return mint(1);
    mint a = pow(t>>1);
    a *= a;
    if(t&1) a *= *this;
    return a;
  }
  
  //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 ret(*this);
    return ret /= a;
  }
};
ostream &operator<<(ostream& os, const mint& x) {
  os << x.x;
  return os;
}
class modutils {
  vector<mint> fact, invfact;
public:
  modutils(int n = 2000005):fact(n+1),invfact(n+1) {
    fact[0] = 1;
    for(int i=1; i<=n; i++) fact[i] = fact[i-1] * i;
    invfact[n] = fact[n].inv();
    for(int i=n; i>=1; i--) invfact[i-1] = invfact[i] * i;
  }
  mint pow(mint x, ll n) {
    return x.pow(n);
  }
  mint comb(ll n, ll k) {
    if(n<0 || k<0 || n<k) return 0;
    return fact[n] * invfact[k] * invfact[n-k];
  }
  mint perm(ll n, ll k) {
    if(n<0 || k<0 || n<k) return 0;
    return fact[n] * invfact[n-k];
  }
  mint fac(ll n) {
    return fact[n];
  }
};
modutils mutil;



int main(){
  int H, W;
  cin >> H >> W;
  vector<vector<int>> v(H, vector<int>(W));
  mint all(1);
  rep(i,H){
    rep(j,W){
      cin >> v[i][j];
      all *= v[i][j];
    }
  }

  vector<mint> vh(H), vw(W);
  int zh = 0, zw = 0;
  rep(i,H){
    mint tmp(1);
    bool z = false;
    rep(j,W){
      tmp *= v[i][j];
      if(v[i][j] == 0) z = true;
    }
    vh[i] = tmp;
    if(z) zh++;
  }
  rep(i,W){
    mint tmp(1);
    bool z = false;
    rep(j,H){
      tmp *= v[j][i];
      if(v[i][j] == 0) z = true;
    }
    vw[i] = tmp;
    if(z) zw++;
  }

  if(zh >= 2 || zw >= 2){
    int Q;
    cin >> Q;
    rep(i,Q){
      int r, c;
      cin >> r >> c;
      cout << 0 << endl;
    }
  }
  else if(zh == 0){
    int Q;
    cin >> Q;
    rep(i,Q){
      int r, c;
      cin >> r >> c;
      r--;
      c--;
      mint ret = all;
      
      ret *= vh[r].inv();
      ret *= vw[c].inv();
      ret *= v[r][c];
      cout << ret << endl;
    }
  }
  else{
    int xx, yy;
    rep(i,H){
      rep(j,W){
        if(v[i][j] == 0){
          yy = i;
          xx = j;
        }
      }
    }
    all = mint(1);
    rep(i,H){
      rep(j,W){
        if(i == yy || j == xx) continue;
        all *= v[i][j];
      }
    }
    int Q;
    cin >> Q;
    rep(i,Q){
      int r, c;
      cin >> r >> c;
      r--;
      c--;
      if(r == yy && c == xx){
        cout << all << endl;
      }else{
        cout << 0 << endl;
      }
    }
  }
  
  return 0;
}