//
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define lch (o << 1)
#define rch (o << 1 | 1)

typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pint;
typedef tuple<int, int, int> tint;

const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const ll INF_LL = 0x3f3f3f3f3f3f3f3f;

ll QPow(ll bas, int t) {
	ll ret = 1;
	while (t) {
		if (t & 1) ret = ret * bas % MOD;
		bas = bas * bas % MOD;
		t >>= 1;
	}
	return ret;
}

ll Inv(ll x) {
	return QPow(x, MOD - 2);
}

int n, m;

int Idx(int x, int y) {
	return (x - 1) * m + y - 1;
}

int a[N];
ll r[N], c[N];
int r0[N], c0[N];

int main() {
	ios::sync_with_stdio(0);

	cin >> n >> m;
	int sum0 = 0;
	ll prod = 1;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) {
			cin >> a[Idx(i, j)];
			if (a[Idx(i, j)] == 0)
				sum0++;
			else
				prod = prod * a[Idx(i, j)] % MOD;
		}

	for (int i = 1; i <= n; i++) {
		r[i] = 1;
		for (int j = 1; j <= m; j++) {
			if (a[Idx(i, j)] == 0)
				r0[i]++;
			else
				r[i] = r[i] * a[Idx(i, j)] % MOD;
		}
	}

	for (int j = 1; j <= m; j++) {
		c[j] = 1;
		for (int i = 1; i <= n; i++) {
			if (a[Idx(i, j)] == 0)
				c0[j]++;
			else
				c[j] = c[j] * a[Idx(i, j)] % MOD;
		}
	}

	int q;
	cin >> q;
	while (q--) {
		int x, y;
		cin >> x >> y;
		int res = sum0 - r0[x] - c0[y] + (a[Idx(x, y)] == 0);
		if (res) {
			cout << 0 << endl;
		} else {
			ll ans = prod * Inv(r[x]) % MOD * Inv(c[y]) % MOD;
			if (a[Idx(x, y)]) ans = ans * a[Idx(x, y)] % MOD;
			cout << ans << endl;
		}
	}

	return 0;
}