#include using namespace std; #define int long long #define ii pair #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define f first #define s second #define Time (double)clock()/CLOCKS_PER_SEC #define debug(x) std::cout << #x << ": " << x << '\n'; const int N = 1e5+7, MOD = 1000 * 1000 * 1000 + 7; //need define int long long int mod(int n) { n %= MOD; if (n < 0) return n + MOD; else return n; } int fp(int a, int p) { int ans = 1, c = a; for (int i = 0; (1ll << i) <= p; ++i) { if ((p >> i) & 1) ans = mod(ans * c); c = mod(c * c); } return ans; } int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); } struct M { ll x; M (int x_) { x = mod(x_); } M () {} M operator + (M y) { int ans = x + y.x; if (ans >= MOD) ans -= MOD; return M(ans); } M operator - (M y) { int ans = x - y.x; if (ans < 0) ans += MOD; return M(ans); } M operator * (M y) { return M(x * y.x % MOD); } M operator / (M y) { return M(x * fp(y.x, MOD - 2) % MOD); } M operator + (int y) { return (*this) + M(y); } M operator - (int y) { return (*this) - M(y); } M operator * (int y) { return (*this) * M(y); } M operator / (int y) { return (*this) / M(y); } M operator ^ (int p) { return M(fp(x, p)); } void operator += (M y) { *this = *this + y; } void operator -= (M y) { *this = *this - y; } void operator *= (M y) { *this = *this * y; } void operator /= (M y) { *this = *this / y; } void operator += (int y) { *this = *this + y; } void operator -= (int y) { *this = *this - y; } void operator *= (int y) { *this = *this * y; } void operator /= (int y) { *this = *this / y; } void operator ^= (int p) { *this = *this ^ p; } }; M f[N], inv[N]; void prec() { f[0] = M(1); for (int i = 1; i < N; ++i) f[i] = f[i - 1] * M(i); inv[N - 1] = f[N - 1] ^ (MOD - 2); for (int i = N - 2; i >= 0; --i) inv[i] = inv[i + 1] * M(i + 1); } M C(int n, int k) { if (n < k) return M(0); else return f[n] * inv[k] * inv[n - k]; } vector a[N]; M row[N], col[N]; int row0[N], col0[N], all0 = 0; signed main() { #ifdef HOME freopen("input.txt", "r", stdin); #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif int n, m; cin >> n >> m; for (int i = 0; i < n; ++i) { a[i].resize(m); for (int j = 0; j < m; ++j) { int x; cin >> x; a[i][j] = M(x); } } for (int i = 0; i < n; ++i) { row[i] = M(1); for (int j = 0; j < m; ++j) { row[i] *= a[i][j]; if (a[i][j].x == 0) ++row0[i]; } } for (int j = 0; j < m; ++j) { col[j] = M(1); for (int i = 0; i < n; ++i) { col[j] *= a[i][j]; if (a[i][j].x == 0) ++col0[j]; } } M all = M(1); for (int i = 0; i < n; ++i) for (int j = 0; j < m; ++j) { all *= a[i][j]; if (a[i][j].x == 0) ++all0; } int q; cin >> q; while (q--) { int i, j; cin >> i >> j; --i; --j; int nul = all0 - row0[i] - col0[j] + (a[i][j].x == 0); if (nul > 0) { cout << 0 << endl; } else { cout << (all / (row[i] * col[j]) * a[i][j]).x << endl; } } }