import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const Q = readInt();
      const M = readInt();
      auto A = new long[][](M, M);
      foreach (x; 0 .. M) foreach (y; 0 .. M) {
        A[x][y] = readLong();
      }
      auto X = new int[Q];
      auto Y = new int[Q];
      foreach (q; 0 .. Q) {
        X[q] = readInt() - 1;
        Y[q] = readInt() - 1;
      }
      
      auto sum = new long[][](M + 1, M + 1);
      foreach (x; 0 .. M) foreach (y; 0 .. M) {
        sum[x + 1][y + 1] = sum[x + 1][y] + sum[x][y + 1] - sum[x][y] + A[x][y];
      }
      
      foreach (q; 0 .. Q) {
        long ans;
        foreach (xa; 0 .. X[q] + 1) foreach (xb; X[q] + 1 .. M + 1) {
          debug {
            writeln(xa, " ", xb, ": ", iota(M + 1).map!(y => (sum[xb][y] - sum[xa][y])));
          }
          long[long] freq;
          foreach (y; 0 .. Y[q] + 1) {
            const s = sum[xb][y] - sum[xa][y];
            ++freq[s];
          }
          foreach (y; Y[q] + 1 .. M + 1) {
            const s = sum[xb][y] - sum[xa][y];
            if (s in freq) {
              ans += freq[s];
            }
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}