#include using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec(i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define PQ priority_queue #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it) #define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it) template bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } } template bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } } template bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } } template bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } } template T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } // ---- ---- #define V2(T, x, y) (x, vector(y, 0LL)) template struct Sum2 { typedef vector> A; A s; int X, Y; Sum2() { X = Y = -1; } Sum2(A & p) { init(p); } void init(A & p) { X = p.size(); Y = p[0].size(); s = A V2(T, X + 1, Y + 1); inc1(x, X) { inc1(y, Y) { s[x][y] = p[x - 1][y - 1]; } } inc1(x, X) { inc1(y, Y) { s[x][y] += s[x - 1][y ]; } } inc1(x, X) { inc1(y, Y) { s[x][y] += s[x ][y - 1]; } } } T sum(int xl, int xh, int yl, int yh) { // [xl, xh) × [yl, yh) assert(inII(xl, 0, X)); assert(inII(xh, 0, X)); assert(inII(yl, 0, Y)); assert(inII(yh, 0, Y)); assert(xl <= xh); assert(yl <= yh); return s[xh][yh] - s[xh][yl] - s[xl][yh] + s[xl][yl]; } }; // ---- vector> a V2(LL, 130, 130); LL m, n, x[10], y[10]; int main() { cin >> n >> m; inc(i, m) { inc(j, m) { cin >> a[i][j]; } } Sum2 s(a); inc(q, n) { int x, y; cin >> x >> y; int ans = 0; incID(il, 0, x) { incID(jl, 0, y) { incII(ih, x, m) { incII(jh, y, m) { if(s.sum(il, ih, jl, jh) == 0) { ans++; } } } } } cout << ans << endl; } return 0; }