#include<bits/stdc++.h>
#define rep(i, s, n) for (int i=(s); i<(n); i++)
#define ll long long
#define P pair<int, int>
using namespace std;

int main() {
  ll h,w,n; cin>>h>>w>>n;
  set<P> s,check;
  rep(i, 0, n) {
    int a,b; cin>>a>>b;
    s.insert(P(a, b));
  }
  ll res[10]={};
  res[0]=(ll)(h-2)*(w-2);
  for (P i: s) {
    int a=i.first;
    int b=i.second;
    rep(x, -1, 2) {
      rep(y, -1, 2) {
        int nx=a+x,ny=b+y;
        if (!(1<nx&&nx<=h-1)) continue;
        if (!(1<ny&&ny<=w-1)) continue;
        check.insert(P(nx, ny));
      }
    }
  }
  for (P p: check) {
    int tmp=0;
    rep(x, -1, 2) {
      rep(y, -1, 2) {
        if (s.count(P(p.first+x, p.second+y))) tmp++;
      }
    }
    res[tmp]++;
    res[0]--;
  }
  rep(i, 0, 10) cout<<res[i]<<endl;
}