#include <bits/stdc++.h>

using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;

#define fi first
#define se second

const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);

void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}

ll Pow(ll A, ll N){
  if (N == 0) return 1;
  if (N % 2 == 0) return Pow(A*A%MOD, N/2);
  return Pow(A*A%MOD, N/2)*A%MOD;
}

int main(){
  int H, W; cin >> H >> W;
  ll A[H][W], sum = 1;
  for (int i = 0; i < H; i++){
    for (int j = 0; j < W; j++){
      cin >> A[i][j];
      sum *= A[i][j]; sum %= MOD;
    }
  }

  vector <ll> h(H), w(W);
  for (int i = 0; i < H; i++){
    ll now = 1;
    for (int j = 0; j < W; j++){
      now *= A[i][j]; now %= MOD;
    }
    h[i] = now;
  }
  for (int j = 0; j < W; j++){
    ll now = 1;
    for (int i = 0; i < H; i++){
      now *= A[i][j]; now %= MOD;
    }
    w[j] = now; 
  }

  int Q; cin >> Q;
  for (int i = 0; i < Q; i++){
    int r, c; cin >> r >> c;
    ll ans = sum;
    ans *= Pow(h[r-1], MOD-2); ans %= MOD;
    ans *= Pow(w[c-1], MOD-2); ans %= MOD;
    ans *= A[r-1][c-1]; ans %= MOD;
    cout << ans << endl;
  }


  return 0;
}