#include<stdio.h>
#include<stdlib.h>

typedef long long int int64;

#define POS(i,j) ((i)*(m+1)+(j))

void run(void){
  int n,m;
  scanf("%d%d",&n,&m);
  int64 *a=(int64 *)calloc((m+1)*(m+1),sizeof(int64));
  int i,j,k,l;
  for(i=1;i<=m;i++){
    for(j=1;j<=m;j++){
      scanf("%lld",a+POS(i,j));
      a[POS(i,j)]+=a[POS(i-1,j)]+a[POS(i,j-1)]-a[POS(i-1,j-1)];
    }
  }
  const int p=45;
  int *cnt=(int *)calloc((m+1)*(m+1),sizeof(int));
  for(i=1;i<=m-p;i++){
    for(j=i+p;j<=m;j++){
      for(k=1;k<=m-p;k++){
        for(l=k+p;l<=m;l++){
          if(a[POS(j,l)]-a[POS(i-1,l)]-a[POS(j,k-1)]+a[POS(i-1,k-1)]==0){
            cnt[POS(i,k)]++;
            if(j+1<=m) cnt[POS(j+1,k)]--;
            if(l+1<=m) cnt[POS(i,l+1)]--;
            if(j+1<=m && l+1<=m) cnt[POS(j+1,l+1)]++;
          }
        }
      }
    }
  }
  for(i=1;i<=m;i++){
    for(j=1;j<=m;j++){
      cnt[POS(i,j)]+=cnt[POS(i-1,j)]+cnt[POS(i,j-1)]-cnt[POS(i-1,j-1)];
    }
  }
  while(n--){
    int x,y;
    scanf("%d%d",&x,&y);
    int ans=cnt[POS(x,y)];
    for(i=x;i>=1 && i>x-p;i--){
      for(j=x;j<=m && j<i+p;j++){
    	for(k=y;k>=1 && k>y-p;k--){
	      for(l=y;l<=m && l<k+p;l++){
	        if(a[POS(j,l)]-a[POS(i-1,l)]-a[POS(j,k-1)]+a[POS(i-1,k-1)]==0) ans++;
    	  }
    	}
      }
    }
    printf("%d\n",ans);
  }
}

int main(void){
  run();
  return 0;
}