#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N, M;
ll A[140][140];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> M;

    for(int i=1;i<=M;++i){
        for(int j=1;j<=M;++j){
            std::cin >> A[i][j];
        }

        for(int j=2;j<=M;++j){
            A[i][j] += A[i][j-1];
        }
    }
    
    for(int i=0;i<N;++i){
        int x, y;
        std::cin >> x >> y;

        std::swap(x, y);

        ll res = 0;
        
        for(int i=1;i<=x;++i){
            for(int j=x;j<=M;++j){
                ll sum = 0;
                std::map<ll, int> cnt;
                cnt[0] = 1;
                
                for(int k=1;k<y;++k){
                    sum += A[k][j] - A[k][i-1];
                    cnt[sum] += 1;
                }

                for(int k=y;k<=M;++k){
                    sum += A[k][j] - A[k][i-1];
                    res += cnt[sum];
                }
            }
        }

        std::cout << res << std::endl;
    }
}