#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(10)
#define highest(x) (63 - __builtin_clzl(x))

int main(){
    int N, M;
    cin >> N >> M;
    long A[M + 1][M + 1];
    for(int i = 0; i <= M; i++){
        A[i][0] = A[0][i] = 0;
    }
    for(int i = 1; i <= M; i++){
        cins(A[i] + 1, A[i] + M + 1);
    }
    for(int i = 0; i < M; i++){
        for(int j = 0; j < M; j++){
            A[i + 1][j + 1] += A[i][j + 1] + A[i + 1][j] - A[i][j];
        }
    }
    for(int i = 0; i < N; i++){
        int x, y;
        cin >> x >> y;
        int ans = 0;
        for(int j = 0; j <= x - 1; j++){
            for(int k = x; k <= M; k++){
                map<long, int> nums;
                for(int l = 0; l <= y - 1; l++){
                    nums[A[j][l] - A[k][l]]++;
                }
                for(int l = y; l <= M; l++){
                    ans += nums[A[j][l] - A[k][l]];
                }
            }
        }
        cout << ans << endl;
    }
}