#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

#include <atcoder/modint>
using namespace atcoder;
using mint = modint1000000007;

vector<int> di = {-1, -1, 1, 1};
vector<int> dj = {-1, 1, 1, -1};

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int H, W;
	cin >> H >> W;
	vector A(4, vector(H, vector<mint>(W)));
	rep(i, 0, H) rep(j, 0, W) {
		int t;
		cin >> t;
		rep(k, 0, 4) A[k][i][j] = t;
	}
	
	rep(i, 1, H) rep(j, 0, W) {
		A[0][i][j] *= A[0][i - 1][j];
		A[1][i][j] *= A[1][i - 1][j];
		A[2][H - i - 1][j] *= A[2][H - i][j];
		A[3][H - i - 1][j] *= A[3][H - i][j];
	}
	rep(i, 0, H) rep(j, 1, W) {
		A[0][i][j] *= A[0][i][j - 1];
		A[1][i][W - j - 1] *= A[1][i][W - j];
		A[2][i][W - j - 1] *= A[2][i][W - j];
		A[3][i][j] *= A[3][i][j - 1];
	}
	
	int Q;
	cin >> Q;
	for (;Q--;) {
		int r, c;
		cin >> r >> c;
		--r, --c;
		
		mint ans = 1;
		rep(dir, 0, 4) {
			int i = r + di[dir];
			int j = c + dj[dir];
			if (i < 0 || H <= i || j < 0 || W <= j) continue;
			ans *= A[dir][i][j];
		}
		cout << ans.val() << '\n';
	}
}