#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int Q, N;
ll B[200][200];
vector<ll> D[210][210];

void solve() {
	cin >> Q >> N;
	rep(i, 0, N) {
		rep(j, 0, N) {
			cin >> B[i + 1][j + 1];
			B[i + 1][j + 1] += B[i + 1][j] + B[i][j + 1] - B[i][j];
		}
	}
	// rep(i, 0, N + 1) {
	// 	debug(vi(B[i], B[i] + N + 1));
	// }
	while(Q--) {
		int x, y; cin >> x >> y; x--; y--;
		rep(i, 0, y + 1) {
			rep(j, y + 1, N + 1) D[i][j].clear();
		}
		rep(i, 0, y + 1) {
			rep(j, y + 1, N + 1) {
				rep(k, x + 1, N + 1) {
					D[i][j].pb(B[k][j] - B[k][i]);
				}
			}
		}
		rep(i, 0, y + 1) {
			rep(j, y + 1, N + 1) {
				sort(all(D[i][j]));
			}
		}
		ll res = 0;
		rep(i, 0, x + 1) {
			rep(j, 0, y + 1) {
				rep(k, y + 1, N + 1) {
					ll v = B[i][j] - B[i][k];
					res += upper_bound(all(D[j][k]), -v) - lower_bound(all(D[j][k]), -v);
				}
			}
		}
		cout << res << "\n";
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}