#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n, m;
	cin>>n>>m;
	ll a[131][131], s[131][131]={};
	for(int i=1; i<=m; i++){
		for(int j=1; j<=m; j++){
			cin>>a[i][j];
			s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
		}
	}
	for(int i=0; i<n; i++){
		int x, y;
		cin>>x>>y;
		int ans=0;
		for(int a=1; a<=x; a++){
			for(int b=x; b<=m; b++){
				for(int c=1; c<=y; c++){
					for(int d=y; d<=m; d++){
						if(s[b][d]-s[a-1][d]-s[b][c-1]+s[a-1][c-1]==0) ans++;
					}
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}