//g++ t2.cpp -o t2 && t2 < p.txt

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#include <map>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldINF = 1e18; const double EPS = 1e-6;
template<typename T, typename U, typename O> void caut(T a, U b, O c){cout<<"("<<a<<","<<b<<","<<c<<") ";} template<typename T, typename U> void caut(T a, U b){cout<<"("<<a<<","<<b<<") ";} template<typename T> void caut(T a){cout<<"("<<a<<") ";}
using P=pair<int,int>;
const ll M = 1e9+7, mx = 200000;
void add(ll& x, ll y) {x+=y; x%=M;}; void mul(ll& x, ll y) {x*=y; x%=M;}; void chmax(ll& x, ll y) {if (x<y) x=y;}; void chmin(ll& x, ll y) {if (x>y) x=y;};
const ll A = 3;
ll mod_pow(ll x, ll a) { ll an = 1; while(a > 0) { if (a&1) an = an * x % M; x = x * x % M; a >>= 1;} return an;}

int main() {
  int h,w; cin>>h>>w;
  ll a[h][w];
  for(int i=0;i<h;i++) {
    for(int j=0;j<w;j++) {
      cin>>a[i][j];
    }
  }
  ll p[h], q[w];
  for(int i=0;i<h;i++) {
    ll sm = 1;
    for(int j=0;j<w;j++) {
      sm *= a[i][j];
      sm %= M;
    }
    p[i] = sm;
  }
  for(int i=0;i<w;i++) {
    ll sm = 1;
    for(int j=0;j<h;j++) {
      sm *= a[j][i];
      sm %= M;
    }
    q[i] = sm;
  }

  ll aa = 1;
  for(int i=0;i<h;i++) {
    for(int j=0;j<w;j++) {
      aa *= a[i][j]; aa %= M;
    }
  }
  int qq; cin>>qq;
  for(int i=0;i<qq;i++) {
    int r,c; cin>>r>>c; r--; c--;
    ll an = aa;
    an *= mod_pow(p[r], M-2); an %= M;
    an *= mod_pow(q[c], M-2); an %= M;
    an *= a[r][c]; an %= M;
    cout<<an<<endl;
  }
}