#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair



int main() {
  fio();
  int n, m;
  cin >> n >> m;
  const ll ADD = 100000000000000000;
  vll a(m, vl(m));
  rep (i, m) {
    rep (j, m) {
      cin >> a[i][j];
    }
  }
  vl x(n), y(n);
  rep (i, n) {
    cin >> y[i] >> x[i];
    y[i]--; x[i]--;
  }
  rep (q, n) {
    a[y[q]][x[q]] += ADD;
    vll sum(m + 1, vl (m + 1));
    rep (i, m) {
      rep (j, m) {
        sum[i + 1][j + 1] = sum[i + 1][j] + a[i][j];
      }
    }
    rep (i, m) {
      rep (j, m + 1) {
        sum[i + 1][j] += sum[i][j];
      }
    }
    vector<vll> diff(m, vll(m + 1));
    rep (i0, m) {
      for (int i1 = i0 + 1; i1 <= m; i1++) {
        rep (j, m + 1) {
          diff[i0][i1].push_back(sum[i1][j] - sum[i0][j]);
        }
        sort(all(diff[i0][i1]));
      }
    }
    int ans = 0;
    rep (i0, m) {
      for (int i1 = i0 + 1; i1 <= m; i1++) {
        rep (j, m + 1) {
          ll now = -sum[i1][j] + sum[i0][j];
          if (now >= ADD / 2 || now <= -ADD / 2) {
            break;
          }
          ll nokori = ADD - now;
          ans += upper_bound(all(diff[i0][i1]), nokori) - lower_bound(all(diff[i0][i1]), nokori);
        }
      }
    }
    cout << ans << endl;
    a[y[q]][x[q]] -= ADD;
  }
}