// {{{ define basic macro
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) repi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)

#define foreach(x,a) for(auto& (x) : (a) )
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)

#define all(x) (x).begin(),(x).end()
#define sum(v) accumulate(all(v), 0)
#define sz(x) ((int)(x).size())
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
#define fill(x,y) memset(x,y,sizeof(x))
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ten(n) ((int)1e##n)

template <class T = int>
T in() {T x; cin>>x; return (x);}

struct Fast {
  Fast(){
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
// }}}
//{{{ others
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
//}}}
//{{{ dump macro
#ifdef PCM
  #include "dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}

#define infile "../test/sample-2.in"
#define int long long
// #define INF 2147483647
#define INF 1000000000000000000LL
#define MOD 1000000007LL
//-----------------------------------
int dx[]={1, -1, 0};
int dy[]={0, 1, -1};

int solve(){
  int h,w,n;cin>>h>>w>>n;

  int a[n],b[n];
  set<pii> black;
  rep(i, n){
    cin>>a[i]>>b[i];
    a[i]--;b[i]--;
    black.insert(mp(a[i], b[i]));
  }
  dump(black);

  set<pii> used;
  int ans[10]={};
  rep(i, n){
    rep(j, 3){
      rep(k, 3){
        int nx = a[i]+dx[j]-1;
        int ny = b[i]+dy[k]-1;
        if (used.find(mp(nx,ny))!=used.end()) continue;
        used.insert(mp(nx, ny));

        if (0<=nx && nx<=h-1 && 0<=ny && ny<=w-1){
          int cnt=0;
          bool flag=true;
          rep(p, 3){
            rep(q, 3){
              int nnx = nx+dx[p]+1;
              int nny = ny+dy[q]+1;
              if (0<=nnx && nnx<=h-1 && 0<=nny && nny<=w-1){
                if (black.find(mp(nnx,nny))!=black.end()) cnt++;
              }
              else{
                flag = false;
              }
            }
          }
          if (cnt==0 and flag){
            dump(i,j,k,nx,ny);
          }
          if (flag) ans[cnt]++;
        }
      }
    }
  }

  dump_1d(ans, 10);
  ans[0] = (h*w) - (2*h+2*w-4) - accumulate(ans, ans+10, 0);
  rep(i, 10){
    cout << ans[i] << endl;
  }

  return 0;
}

int test(){ //{{{
  return 0;
}
//}}}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
#ifdef PCM
  test();
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 48640