//#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"

using namespace std;

//------------------------------- Libraries --------------------------------//

template <int p>
struct Modint
{
    int value;

    Modint() : value(0) {}
    Modint(long x) : value(x >= 0 ? x % p : (p + x % p) % p) {}

    inline Modint &operator+=(const Modint &b)
    {
        if ((this->value += b.value) >= p)
            this->value -= p;
        return (*this);
    }
    inline Modint &operator-=(const Modint &b)
    {
        if ((this->value += p - b.value) >= p)
            this->value -= p;
        return (*this);
    }
    inline Modint &operator*=(const Modint &b)
    {
        this->value = (int)((1LL * this->value * b.value) % p);
        return (*this);
    }
    inline Modint &operator/=(const Modint &b)
    {
        (*this) *= b.inverse();
        return (*this);
    }

    Modint operator+(const Modint &b) const { return Modint(*this) += b; }
    Modint operator-(const Modint &b) const { return Modint(*this) -= b; }
    Modint operator*(const Modint &b) const { return Modint(*this) *= b; }
    Modint operator/(const Modint &b) const { return Modint(*this) /= b; }

    inline Modint &operator++(int) { return (*this) += 1; }
    inline Modint &operator--(int) { return (*this) -= 1; }

    inline bool operator==(const Modint &b) const
    {
        return this->value == b.value;
    }
    inline bool operator!=(const Modint &b) const
    {
        return this->value != b.value;
    }
    inline bool operator<(const Modint &b) const
    {
        return this->value < b.value;
    }
    inline bool operator<=(const Modint &b) const
    {
        return this->value <= b.value;
    }
    inline bool operator>(const Modint &b) const
    {
        return this->value > b.value;
    }
    inline bool operator>=(const Modint &b) const
    {
        return this->value >= b.value;
    }

    // requires that "this->value and p are co-prime"
    // a_i * v + a_(i+1) * p = r_i
    // r_i = r_(i+1) * q_(i+1) * r_(i+2)
    // q == 1 (i > 1)
    // reference: https://atcoder.jp/contests/agc026/submissions/2845729
    // (line:93)
    inline Modint inverse() const
    {
        assert(this->value != 0);
        int r0 = p, r1 = this->value, a0 = 0, a1 = 1;
        while (r1)
        {
            int q = r0 / r1;
            r0 -= q * r1;
            swap(r0, r1);
            a0 -= q * a1;
            swap(a0, a1);
        }
        return Modint(a0);
    }

    friend istream &operator>>(istream &is, Modint<p> &a)
    {
        long t;
        is >> t;
        a = Modint<p>(t);
        return is;
    }
    friend ostream &operator<<(ostream &os, const Modint<p> &a)
    {
        return os << a.value;
    }
};

/*
verified @ https://atcoder.jp/contests/abc034/submissions/4316971
*/

const int MOD = 1e9 + 7;

using Int = Modint<MOD>;

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//akari : 1D, yukari : 2D, maki : 3D vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//akane : ascending order, aoi : decending order
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;

//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//

void solve()
{
    int n, m;
    cin >> n >> m;
    yukari<i64> grid(m + 1, akari<i64>(m + 1));
    for (int i = 0; i < m; i++)
        for (int j = 0; j < m; j++)
        {
            cin >> grid[i + 1][j + 1];
        }
    for (int i = 0; i <= m; i++)
        for (int j = 0; j < m; j++)
        {
            grid[i][j + 1] += grid[i][j];
        }
    for (int i = 0; i < m; i++)
        for (int j = 0; j <= m; j++)
        {
            grid[i + 1][j] += grid[i][j];
        }
    yukari<i64> imos(m + 1, akari<i64>(m + 1));
    for (int lx = 0; lx < m; lx++)
        for (int ly = 0; ly < m; ly++)
            for (int rx = lx; rx < m; rx++)
                for (int ry = ly; ry < m; ry++)
                {
                    i64 sum = 0;
                    sum += grid[ly][lx];
                    sum -= grid[ry + 1][lx];
                    sum -= grid[ly][rx + 1];
                    sum += grid[ry + 1][rx + 1];
                    if (sum == 0)
                    {
                        imos[lx][ly]++;
                        imos[lx][ry + 1]--;
                        imos[rx + 1][ly]--;
                        imos[rx + 1][ry + 1]++;
                    }
                }
    for (int i = 0; i <= m; i++)
        for (int j = 0; j < m; j++)
        {
            imos[i][j + 1] += imos[i][j];
        }
    for (int i = 0; i < m; i++)
        for (int j = 0; j <= m; j++)
        {
            imos[i + 1][j] += imos[i][j];
        }
    while (n--)
    {
        int x, y;
        cin >> x >> y;
        x--, y--;
        cout << imos[y][x] << endl;
    }
}

int main()
{
    solve();
    return 0;
}