#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

const long long MOD = 1e9 + 7;

long long modpow(long long x, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1)
      ret = ret * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int h, w;
  cin >> h >> w;
  vector<vector<int> > a(h, vector<int>(w));

  long long sum = 1;
  REP (i, h) REP (j, w) {
    cin >> a[i][j];
    sum = sum * a[i][j] % MOD;
  }

  vector<long long> hsum(h), wsum(w);
  REP (i, h) {
    hsum[i] = 1;
    REP (j, w) hsum[i] = hsum[i] * a[i][j] % MOD;
  }
  REP (j, w) {
    wsum[j] = 1;
    REP (i, h) wsum[j] = wsum[j] * a[i][j] % MOD;
  }
  
  int q;
  cin >> q;
  while (q--) {
    int r, c;
    cin >> r >> c;
    --r, --c;
    long long ret = a[r][c];
    ret = ret * sum % MOD;
    ret = ret * modpow(hsum[r], MOD-2, MOD) % MOD;
    ret = ret * modpow(wsum[c], MOD-2, MOD) % MOD;
    cout << ret << endl;
  }
    
  return 0;
}