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

int main(){
    ll h,w; cin >> h >> w;
    int n; cin >> n;
    ll a[n], b[n]; rep(i,n) cin >> a[i] >> b[i];
    map<pair<ll,ll>,int> m;
    // 区間を左上マスで数える
    rep(i,n){
        rep(j,3) rep(k,3){
            if(a[i]-j > 0 && a[i]-j <= h-2 && b[i]-k > 0 && b[i]-k <= w-2) m[make_pair(a[i]-j,b[i]-k)]++;
        }
    }
    vector<ll> ans(10,0LL);
    for(auto i:m) ans[i.second]++;
    ans[0] = (h-2)*(w-2);
    rep(i,9) ans[0] -= ans[i+1];
    rep(i,10) cout << ans[i] << "\n";
}