#include #include template std::vector vec(int len, T elem) { return std::vector(len, elem); } template struct ModInt { using lint = long long; int val; // constructor ModInt(lint v = 0) : val(v % MOD) { if (val < 0) val += MOD; }; // unary operator ModInt operator+() const { return ModInt(val); } ModInt operator-() const { return ModInt(MOD - val); } ModInt inv() const { return this->pow(MOD - 2); } // arithmetic ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; } ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; } ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; } ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; } ModInt pow(lint n) const { auto x = ModInt(1); auto b = *this; while (n > 0) { if (n & 1) x *= b; n >>= 1; b *= b; } return x; } // compound assignment ModInt& operator+=(const ModInt& x) { if ((val += x.val) >= MOD) val -= MOD; return *this; } ModInt& operator-=(const ModInt& x) { if ((val -= x.val) < 0) val += MOD; return *this; } ModInt& operator*=(const ModInt& x) { val = lint(val) * x.val % MOD; return *this; } ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); } // compare bool operator==(const ModInt& b) const { return val == b.val; } bool operator!=(const ModInt& b) const { return val != b.val; } bool operator<(const ModInt& b) const { return val < b.val; } bool operator<=(const ModInt& b) const { return val <= b.val; } bool operator>(const ModInt& b) const { return val > b.val; } bool operator>=(const ModInt& b) const { return val >= b.val; } // I/O friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; } friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; } }; constexpr int MOD = 1000000007; using mint = ModInt; void solve() { int h, w; std::cin >> h >> w; int zero = 0; mint prod = 1; std::vector zrow(h, 0), zcol(w, 0); std::vector prow(h, 1), pcol(w, 1); auto xss = vec(h, vec(w, 0)); for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { auto& x = xss[i][j]; std::cin >> x; int z = (x == 0); mint p = (x == 0 ? 1 : x); zero += z; prod *= p; zrow[i] += z; prow[i] *= p; zcol[j] += z; pcol[j] *= p; } } int q; std::cin >> q; while (q--) { int i, j; std::cin >> i >> j; --i, --j; mint p = prow[i] * pcol[j]; int z = zrow[i] + zrow[j]; auto x = xss[i][j]; z -= (x == 0); p /= (x == 0 ? 1 : x); if (zero - z > 0) { std::cout << 0 << "\n"; } else { std::cout << prod / p << "\n"; } } } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }