#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

ll mod_pow(ll a, ll n) {
	if(n == 0) return 1;
	ll res = mod_pow(a, n / 2);
	if(n % 2 == 0) return res * res % mod;
	else return a * res % mod * res % mod;
}

ll invf(ll a) {
	return mod_pow(a, mod - 2);
}

int N, M;

void solve() {
	cin >> N >> M;
	vector<vector<ll>> A(N, vl(M, 0));
	vector<vector<ll>> B(2 * N + 1, vl(2 * M + 1, 0));
	vector<vector<ll>> C(2 * N + 1, vl(2 * M + 1, 1));
	rep(i, 0, N) {
		rep(j, 0, M) {
			ll a; cin >> a;
			if(a == 0) {
				B[i + 1][j + 1] = 1;
				B[i + 1][j + M + 1] = 1;
				B[i + N + 1][j + 1] = 1;
				B[i + N + 1][j + M + 1] = 1;
				a = 1;
			}
			C[i + 1][j + 1] = a;
			C[i + N + 1][j + 1] = a;
			C[i + 1][j + M + 1] = a;
			C[i + N + 1][j + M + 1] = a;
		}
	}
	rep(ii, 0, N * 2) {
		rep(jj, 0, M * 2) {
			B[ii + 1][jj + 1] = B[ii + 1][jj + 1] + B[ii][jj + 1] + B[ii + 1][jj] - B[ii][jj];
			C[ii + 1][jj + 1] = C[ii + 1][jj + 1] * C[ii][jj + 1] % mod * C[ii + 1][jj] % mod * invf(C[ii][jj]) % mod;
		}
	}
	int Q; cin >> Q;
	while(Q--) {
		int a, b; cin >> a >> b; a--; b--;
		if(B[a + N][b + M] - B[a + N][b + 1] - B[a + 1][b + M] + B[a + 1][b + 1] > 0) {
			cout << 0 << "\n";
		}
		else cout << C[a + N][b + M] * invf(C[a + N][b + 1]) % mod * invf(C[a + 1][b + M]) % mod * C[a + 1][b + 1] % mod << "\n";
	}
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}