#include <stdio.h>
#include <algorithm>
using namespace std;

int N,M; long long A[133][133],U[133][133];

int main()
{
	scanf ("%d %d",&N,&M);
	for (int i=1;i<=M;i++){
		for (int j=1;j<=M;j++){
			scanf ("%lld",&A[i][j]);
			A[i][j] += A[i-1][j] + A[i][j-1] - A[i-1][j-1];
		}
	}

	for (int i1=1;i1<=M;i1++) for (int i2=i1;i2<=M;i2++){
		pair<long long, int> X[133];
		X[0] = {0,1};
		for (int j=1;j<=M;j++) X[j] = {A[i2][j] - A[i1-1][j], j+1};
		sort(X,X+M+1);

		for (int j=0;j<=M;){
			int k = j;
			while (k <= M && X[j].first == X[k].first) k++;
			for (int l=j;l<k;l++){
				int d = (k - l - 1) - (l - j);
				int r = X[l].second;
				U[i1][r] += d;
				U[i2+1][r] -= d;
			}
			j = k;
		}
	}

	for (int i=1;i<=M;i++){
		for (int j=1;j<=M;j++){
			U[i][j] += U[i-1][j] + U[i][j-1] - U[i-1][j-1];
		}
	}

	while (N--){
		int x,y; scanf ("%d %d",&x,&y);
		printf ("%lld\n",U[x][y]);
	}

	return 0;
}