#include using namespace std; #define reps(i,s,n) for(int i = s; i < n; i++) #define rep(i,n) reps(i,0,n) #define Rreps(i,n,e) for(int i = n - 1; i >= e; --i) #define Rrep(i,n) Rreps(i,n,0) #define ALL(a) a.begin(), a.end() #define fi first #define se second typedef long long ll; typedef vector vec; typedef vector mat; ll N,M,H,W,Q,K,A,B; string S; //const ll MOD = 998244353; const ll MOD = (1e+9) + 7; typedef pair P; const ll INF = (1LL<<58); class mint{ public: ll x; static unsigned long long mod; static unsigned long long mod_plus; mint(){x = 0;} mint(ll _x) : x((_x < 0 ? ((_x += mod_plus) < 0 ? _x + mod_plus : _x) : _x)%mod){} /*mint& operator=(const ll &a){ x = a; return *this; }*/ mint operator-(){ return x == 0 ? 0 : mod - x; } mint& operator+=(const mint& a){ if((x += a.x) >= mod) x -= mod; return *this; } mint operator+(const mint& a) const{ mint res(*this); return res += a; } mint& operator-=(const mint& a){ if((x -= a.x) < 0) x += mod; return *this; } mint operator-(const mint& a) const{ mint res(*this); return res -= a; } mint& operator*=(const mint& a){ (x *= a.x)%=mod; return *this; } /*mint& operator*=(const ll& a){ mint temp(a); return *this *= temp; }*/ mint operator*(const mint& a) const{ mint res(*this); return res *= a; } /*mint operator*(const ll& a) const{ mint res(*this); return res *= a; }*/ mint pow(unsigned long long pw) const{ mint res(1), comp(*this); while(pw){ if(pw&1) res *= comp; comp *= comp; pw >>= 1; } return res; } //以下、modが素数のときのみ mint inv() const{ mint res(*this); return res.pow(mod - 2); } mint& operator/=(const mint &a){ (x *= a.inv().x)%=mod; return *this; } mint operator/(const mint &a) const{ mint res(*this); return res /= a; } }; ostream& operator<<(ostream& os, const mint& a){ os << a.x; return os; } unsigned long long mint::mod = int(1e+9) + 7; unsigned long long mint::mod_plus = (LLONG_MAX / mint::mod) * mint::mod; typedef vector vm; int main() { cin>>H>>W; vector a(H, vm(W)); vm yoko(H, 1), tate(W, 1); vec y0(H, 0), t0(W, 0); mat zero(H, vec(W, 0)); rep(i,H) rep(j, W) { cin>>a[i][j].x; if(a[i][j].x == 0){ ++y0[i]; ++t0[j]; a[i][j] = 1; zero[i][j] = 1; } yoko[i] *= a[i][j]; tate[j] *= a[i][j]; } cin>>Q; mint sum = 1; rep(i,H) sum *= yoko[i]; ll zero_num = accumulate(ALL(y0), 0LL); rep(i,Q){ ll r, c; cin>>r>>c; --r; --c; if(zero_num != y0[r] + t0[c] - zero[r][c]){ cout<<0<