#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
using namespace std;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(233);
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
	const int maxn = 131072;
	static char buf[maxn],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
	int res(0);
	char c = getchar();
	while(c < '0') c = getchar();
	while(c >= '0') {
		res = res * 10 + (c - '0');
		c = getchar();
	}
	return res;
}

inline LL fastpo(LL x, LL n, LL mod) {
	LL res(1);
	while(n) {
		if(n & 1) {
			res = res * (LL)x % mod;
		}
		x = x * (LL) x % mod;
		n /= 2;
	}
	return res;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

inline string itoa(int x, int width = 0) {
  string res;
  if(x == 0) res.push_back('0');
  while(x) {
    res.push_back('0' + x % 10);
    x /= 10;
  }
  while((int)res.size() < width) res.push_back('0');
  reverse(res.begin(), res.end());
  return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
	fwrite(buf, 1, _bl, stdout);
	_bl = 0;
}
__inline void _putchar(char c) {
	if(_bl == _B) flush();
	buf[_bl++] = c;
}
inline void print(LL x, char c) {
	static char tmp[20];
	int l = 0;
	if(!x) tmp[l++] = '0';
	else {
		while(x) {
			tmp[l++] = x % 10 + '0';
			x /= 10;
		}
	}
	for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
	_putchar(c);
}
struct P {
	D x, y;
};
const int N = 300033;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int a[N], rowprod[N], colprod[N], rowcnt0[N], colcnt0[N];
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	int prod = 1, cnt0 = 0;
	for(int i = 0; i < n * m; i++) {
		scanf("%d", &a[i]);
		if(a[i] == 0) cnt0++;
		else prod = (LL)prod * a[i] % mod;
	}
	for(int i = 0; i < n; i++) rowprod[i] = 1;
	for(int i = 0; i < m; i++) colprod[i] = 1;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			if(a[i * m + j] == 0) {
				rowcnt0[i]++;
				colcnt0[j]++;
			}else {
				rowprod[i] = (LL)rowprod[i] * a[i * m + j] % mod;
				colprod[j] = (LL)colprod[j] * a[i * m + j] % mod;
			}
		}
	}
	int Q;
	scanf("%d", &Q);
	for(int qq = 1; qq <= Q; qq++) {
		int x, y;
		scanf("%d%d", &x, &y);
		x--; y--;
		int id = x * m + y;
		int num0 = cnt0 - rowcnt0[x] - colcnt0[y] + (a[id] == 0);
		if(num0 != 0) {
			printf("0\n");
		}else {
			int ans = prod * (LL)fastpo(rowprod[x] * (LL)colprod[y] % mod, mod - 2, mod) % mod * (a[id] == 0 ? 1 : a[id]) % mod;
			printf("%d\n", ans);
		}
	}
}