#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

struct mint {
	long long x;
	mint(long long x = 0) :x((x% mod + mod) % mod) {}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};

int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */

	ll H, W; scanf("%lld %lld", &H, &W);
	vector<vector<ll>> a(H, vector<ll>(W)); for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) scanf("%lld", &a[i][j]);
	int ch = 0, cw = 0, zh = -1, zw = -1;
	for (int i = 0; i < H; i++) {
		bool ok = false;
		for (int j = 0; j < W; j++) ok |= (a[i][j] == 0);
		if (ok) {
			ch++;
			zh = i;
		}
	}
	for (int j = 0; j < W; j++) {
		bool ok = false;
		for (int i = 0; i < H; i++) ok |= (a[i][j] == 0);
		if (ok) {
			cw++;
			zw = j;
		}
	}
	int kkt; scanf("%d", &kkt);
	if (ch >= 2 or cw >= 2) {
		assert(false);
		for (int i = 0; i < kkt; i++) puts("0");
	}
	else if (ch == 1 or cw == 1) {
		mint all = 1;
		for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) if (zh != i and zw != j) all *= a[i][j];
		while (kkt--) {
			int r, c; scanf("%d %d", &r, &c);
			r--; c--;
			if ((zh == -1 or zh == r) and (zw == -1 or zw == c)) {
				printf("%lld\n", all.x);
			}
			else {
				puts("0");
			}
		}
	}
	else {
		mint all = 1;
		for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) if (zh != i and zw != j) all *= a[i][j];
		vector<mint> pH(H, 1), pW(W, 1);
		for (int i = 0; i < H; i++) {
			mint res = 1;
			for (int j = 0; j < W; j++) res *= a[i][j];
			pH[i] = res;
		}
		for (int j = 0; j < W; j++) {
			mint res = 1;
			for (int i = 0; i < H; i++) res *= a[i][j];
			pW[j] = res;
		}
		while (kkt--) {
			int r, c; scanf("%d %d", &r, &c);
			r--; c--;
			printf("%lld\n", (all / pH[r] / pW[c] * a[r][c]).x);
		}
	}

    return 0;
}