#include <bits/stdc++.h>
 
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
 
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
 
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
 
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
 
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)

//ここから編集

long long extGCD(long long a, long long b, long long &x, long long &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    long long d = extGCD(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
// 負の数にも対応した mod (a = -11 とかでも OK) 
inline long long mod(long long a, long long m) {
    return (a % m + m) % m;
}
 
// 逆元計算 (ここでは a と m が互いに素であることが必要)
long long modinv(long long a, long long m) {
    long long x, y;
    extGCD(a, m, x, y);
    return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(5);
  
  int H, W; cin >> H >> W;

  vector<vector<ll>> A(H, vector<ll>(W));
  vector<int> aa(H,0), bb(W, 0);
  vector<vector<ll>> cum(H+1, vector<ll>(W+1, 1));
  int ct = 0;
  REP(i,H)REP(j,W) {
    cin >> A[i][j];
    cum[i+1][j+1] = A[i][j];
    if(A[i][j] == 0){
      aa[i]++;
      bb[j]++;
      cum[i+1][j+1] = 1;
      ct++;
    }
  }
  
  for(int i=1; i<=H; i++){
    for(int j=1; j<W; j++){
      cum[i][j+1] *= cum[i][j];
      cum[i][j+1] %= MOD;
    }
  }
  for(int j=1; j<=W; j++){
    for(int i=1; i<H; i++){
      cum[i+1][j] *= cum[i][j];
      cum[i+1][j] %= MOD;
    }
  }

  int Q; cin >> Q;
  while(Q--){
    ll r, c; cin >> r >> c;
    
    r--; c--;
    int t = ct;
    t -= aa[r];
    t -= bb[c];
    if(A[r][c] == 0) t++;

    if(t){
      cout << 0 << endl;
      continue;
    }
    ll a = cum[r][c];
    
    ll b = cum[r][W] * modinv(cum[r][c+1], MOD) % MOD;

    ll cx = cum[H][c] * modinv(cum[r+1][c], MOD) % MOD;

    ll d = cum[H][W] * modinv(cum[H][c+1], MOD) % MOD * modinv(cum[r+1][W], MOD)%MOD  * cum[r+1][c+1] % MOD;

    cout << a * b % MOD * cx % MOD * d % MOD << endl;

    
  }

  return 0;
}