#include #include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; using graph = vector > ; using P= pair; using vi=vector; using vvi=vector; using vll=vector; using vvll=vector; using vp=vector

; using vpp=vector; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++14 -I . //cout < par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x; else return par[x] = root(par[x]); } bool issame(int x, int y) { return root(x) == root(y); } bool unite(int x, int y) { x = root(x), y = root(y); if (x == y) return false; if (siz[x] < siz[y]) swap(x, y); par[y] = x; siz[x] += siz[y]; return true; } int size(int x) { return siz[root(x)]; } }; ll gcd(ll x,ll y){ if(y==0)return x; return gcd(y,x%y); } ll lcm(ll x,ll y){ return ll(x/gcd(x,y))*y; } template bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division const ll mod =1e9+7; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} // combination mod prime // https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619 struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { //assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(2000005); using vm=vector ; using vvm=vector ; ll sqrt_(ll x) { ll l = 0, r = ll(3e9)+1; while (l+1=0 && y>=0 && x; using vve =vector; mapd; void comp(vll&a){ sets(a.begin(),a.end()); int cnt=0; for(auto y:s)d[y]=cnt++; for(auto&y:a)y=d[y]; } //snuke template struct Matrix { int h, w; vector > d; Matrix() {} Matrix(int h, int w, T val=0): h(h), w(w), d(h, vector(w,val)) {} Matrix& unit() { //assert(h == w); rep(i,h) d[i][i] = 1; return *this; } const vector& operator[](int i) const { return d[i];} vector& operator[](int i) { return d[i];} Matrix operator*(const Matrix& a) const { //assert(w == a.h); Matrix r(h, a.w); rep(i,h)rep(k,w)rep(j,a.w) { r[i][j] += d[i][k]*a[k][j]; } return r; } Matrix pow(ll t) const { // assert(h == w); if (!t) return Matrix(h,h).unit(); if (t == 1) return *this; Matrix r = pow(t>>1); r = r*r; if (t&1) r = r*(*this); return r; } }; #pragma once template struct SegmentTree2D { private: int id(int h, int w) { return h * 2 * W + w; } public: int H, W; vector seg; const F f; const T I; SegmentTree2D(int h, int w, F _f, const T& i) : f(_f), I(i) { init(h, w); } void init(int h, int w) { H = W = 1; while (H < h) H <<= 1; while (W < w) W <<= 1; seg.assign(4 * H * W, I); } // build にのみ呼ぶ void set(int h, int w, const T& x) { seg[id(h + H, w + W)] = x; } void build() { // w in [W, 2W) for (int w = W; w < 2 * W; w++) { for (int h = H - 1; h; h--) { seg[id(h, w)] = f(seg[id(2 * h + 0, w)], seg[id(2 * h + 1, w)]); } } // h in [0, 2H) for (int h = 0; h < 2 * H; h++) { for (int w = W - 1; w; w--) { seg[id(h, w)] = f(seg[id(h, 2 * w + 0)], seg[id(h, 2 * w + 1)]); } } } T get(int h, int w) const { return seg[id(h + H, w + W)]; } T operator()(int h, int w) const { return seg[id(h + H, w + W)]; } void update(int h, int w, const T& x) { h += H, w += W; seg[id(h, w)] = x; for (int i = h >> 1; i; i >>= 1) { seg[id(i, w)] = f(seg[id(2 * i + 0, w)], seg[id(2 * i + 1, w)]); } for (; h; h >>= 1) { for (int j = w >> 1; j; j >>= 1) { seg[id(h, j)] = f(seg[id(h, 2 * j + 0)], seg[id(h, 2 * j + 1)]); } } } T _inner_query(int h, int w1, int w2) { T res = I; for (; w1 < w2; w1 >>= 1, w2 >>= 1) { if (w1 & 1) res = f(res, seg[id(h, w1)]), w1++; if (w2 & 1) --w2, res = f(res, seg[id(h, w2)]); } return res; } // [ (h1,w1), (h2,w2) ) 半開 T query(int h1, int w1, int h2, int w2) { if (h1 >= h2 || w1 >= w2) return I; T res = I; h1 += H, h2 += H, w1 += W, w2 += W; for (; h1 < h2; h1 >>= 1, h2 >>= 1) { if (h1 & 1) res = f(res, _inner_query(h1, w1, w2)), h1++; if (h2 & 1) --h2, res = f(res, _inner_query(h2, w1, w2)); } return res; } }; /** * @brief 二次元セグメント木 * @docs docs/data-structure-2d/2d-segment-tree.md */ int main(){cin.tie(0); ios::sync_with_stdio(false); int h,w; cin >> h >> w; SegmentTree2D seg(h+1, w+1, [](ll a, ll b) { return (a*b)%mod; }, 1); vvi a(h,vi(w));rep(i,h)rep(j,w)cin >> a[i][j]; rep(i,h)rep(j,w)seg.set(i,j,a[i][j]); seg.build(); int q; cin >> q; vm anss; rep(qi,q){ int x,y; cin >> x >> y;x--;y--; mint ans=1; ans=seg.query(0,0,x,y); ans*=seg.query(0,y+1,x,w); ans*=seg.query(x+1,0,h,y); ans*=seg.query(x+1,y+1,h,w); anss.push_back(ans); } for(auto u:anss)cout << u << endl; }