/*
 * YukiCoder755.cpp
 *
 *  Created on: Dec 25, 2018
 *      Author: Hou
 */


#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>

using namespace std;

int N, M;
long long mat[131][131];
long long sum[131][131];

int main(){
    cin >> N>> M;
    for (int i=1; i<=M; i++)
        for (int j=1; j<=M; j++)
            cin >> mat[i][j];
    sum[0][0] = 0;
    for (int i=1; i<=M; i++){
        sum[i][0] = 0;
        for (int j=1; j<=M; j++)
            sum[i][j] = sum[i][j-1] + mat[i][j];
    }

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

    for (int k=0; k<N; k++){
        int x, y;
        cin >> x>>y;
        int ans = 0;
        for (int x1=1; x1<=x; x1++)
            for (int y1=1; y1<=y; y1++){
                long long s1 = sum[x1-1][y1-1];
                for (int x2=x;x2<=M;x2++){
                    long long s2 = sum[x2][y1-1];
                    for (int y2=y;y2<=M;y2++){
                        long long s3 = sum[x1-1][y2];
                        long long s4 = sum[x2][y2];
                        if (s4-s3-s2+s1 == 0)
                            ans++;
                    }
                }
            }
        cout <<ans <<endl;
    }

	return 0;
}