#include const long long mod = 1e9+7; long long a[100005]; long long row[100005], col[100005]; int cntR[100005], cntC[100005]; long long getElement(int i,int j,int n,int m){ int id = (i-1)*m+j; return a[id]; } long long power(long long a,long long b){ long long res = 1; while(b){ if(b&1) res = res*a%mod; a = a*a%mod; b /= 2; } return res; } long long inv(long long u){ return power(u,mod-2); } int main(){ int n,m; scanf("%d%d",&n,&m); for(int i = 1; i <= n; i++) row[i] = 1, cntR[i] = 0; for(int i = 1; i <= m; i++) col[i] = 1, cntC[i] = 0; long long all = 1; int cnt = 0; for(int i = 1; i <= n; i++){ for(int j = 1; j <= m; j++){ int id = (i-1)*m+j; scanf("%lld",&a[id]); if(a[id]==0){ cntR[i]++; cntC[j]++; cnt++; } else{ row[i] = row[i]*a[id]%mod; col[j] = col[j]*a[id]%mod; all = all*a[id]%mod; } } } int q; scanf("%d",&q); while(q--){ int r,c; scanf("%d%d",&r,&c); int leftCnt = cnt-cntR[r]-cntC[c]; if(getElement(r,c,n,m)==0) leftCnt++; if(leftCnt==0){ long long res = all*inv(row[r])%mod*inv(col[c])%mod; long long middle = getElement(r,c,n,m); if(middle!=0) res = res*middle%mod; printf("%lld\n",res); } else printf("0\n"); } return 0; }