#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 60; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } ll gcd(ll n, ll m) { ll tmp; while (m != 0) { tmp = n % m; n = m; m = tmp; } return n; } ll lcm(ll n, ll m) { return abs(n) / gcd(n, m) * abs(m); //gl=xy } using namespace std; template struct Sum_2D{ vector>cul; bool flag; Sum_2D(int h,int w):cul(h+1,vector(w+1)){ flag=false; } void add(int x,int y,T val){//0インデックス ++x;++y; if(x>=cul.size()||y>=cul[0].size())return; cul[x][y]+=val; } void build(){ flag=true; for(int i=1;i>n>>m; Sum_2Dsum(m,m); rep(i,m)rep(j,m){ ll a; cin>>a; sum.add(i,j,a); } sum.build(); rep(i,n){ int x,y; cin>>x>>y; x--;y--; ll ans=0; REP(o,x+1,m+1)rep(p,x+1)rep(q,y+1)REP(r,y+1,m+1)if(sum.query(o,q,p,r)==0)++ans; cout<