import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;


void main() {
    int n, m;
    scan(n, m);

    auto a = iota(m).map!(i => readln.split.to!(int[])).array;
    auto q = iota(n).map!(i => readln.split.to!(int[])).array;

    auto ac = new long[][](m + 1, m + 1);
    foreach (i ; 1 .. m + 1) {
        foreach (j ; 1 .. m + 1) {
            ac[i][j] = ac[i-1][j] + ac[i][j-1] - ac[i-1][j-1] + a[i-1][j-1];
        }
    }

    debug {
        writefln("%(%s\n%)", ac);
    }

    auto cnt = new long[][](m + 1, m + 1);

    foreach (i ; 0 .. m) {
        foreach (j ; i + 1 .. m + 1) {
            foreach (k ; 0 .. m) {
                foreach (l ; k + 1 .. m + 1) {
                    long wa = ac[j][l] - ac[i][l] - ac[j][k] + ac[i][k];
                    if (wa == 0) {
                        cnt[i][k]++;
                        cnt[j][k]--;
                        cnt[i][l]--;
                        cnt[j][l]++;
                    }
                }
            }
        }
    }

    foreach (i ; 0 .. m + 1) {
        foreach (j ; 0 .. m + 1) {
            cnt[i][j] += (i > 0 ? cnt[i-1][j] : 0)
                         + (j > 0 ? cnt[i][j-1] : 0)
                         - (i > 0 && j > 0 ? cnt[i-1][j-1] : 0);
        }
    }

    foreach (i ; 0 .. n) {
        int x = q[i][0];
        int y = q[i][1];
        x--, y--;

        writeln(cnt[x][y]);
    }
}























void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}