#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
vector<ll> A[100010],l[1000],r[1000];
int main(){
    int i,j,h,w; cin >> h >> w;
    bool flag = false;
    if(h>w) flag = true,swap(h,w);
    if(!flag){
        for(i=0;i<h;i++){
            for(j=0;j<w;j++){
                ll v; cin >> v; A[i].push_back(v);
            }
        }
    }else{
        for(i=0;i<w;i++){
            for(j=0;j<h;j++){
                ll v; cin >> v; A[j].push_back(v);
            }
        }
    }
    for(i=0;i<h;i++){
        l[i].push_back(A[i][0]);
        for(j=1;j<w;j++){
            ll b = l[i].back();
            l[i].push_back(A[i][j]*b%mod);
        }
        r[i].push_back(A[i][w - 1]);
        for(j=w - 2;j>=0;j--){
            ll b = r[i].back();
            r[i].push_back(A[i][j]*b%mod);
        }
        reverse(r[i].begin(),r[i].end());
    }
    ll q; cin >> q;
    for(i=0;i<q;i++){
        ll rr,c; cin >> rr >> c; rr--; c--;
        if(flag) swap(rr,c);
        ll ans = 1;
        for(j=0;j<h;j++){
            if(j==rr) continue;
            if(c>0) (ans *= l[j][c - 1]) %= mod;
            if(c<w - 1) (ans *= r[j][c + 1]) %= mod;
        }
        cout << ans << "\n";
    }
}