#include <bits/stdc++.h>  // ver2.2.9
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define _ <<' '<<
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define Vout(a) rep(lZ,0,a.size()-1)cout<<a[lZ]<<' ';cout<<a.back()<<endl
#define VVout(a) rep(lY,0,a.size()){if(!a[lY].empty()){Vout(a[lY]);}else cout<<endl;}
#define VPout(a) rep(lX,0,a.size())cout<<a[lX].FI<<' '<<a[lX].SE<<endl
#define Verr(a) rep(iZ,0,a.size()-1)cerr<<a[iZ]<<' ';cerr<<a.back()<<endl
#define VVerr(a) rep(J,0,a.size()){if(!a[J].empty()){Verr(a[J]);}else cerr<<'.'<<endl;}
#define VPerr(a) rep(iX,0,a.size())cerr<<a[iX].FI<<' '<<a[iX].SE<<endl
#define INF 3000000000000000000  //  3.0*10^18(MAXの1/3くらい)
#define MAX LLONG_MAX
#define MOD 1000000007  //  10^9 + 7
using namespace std;

int gcd(int a,int b){return b?gcd(b,a%b):a;}  //  最大公約数gcd
int lcm(int a,int b){return a/gcd(a,b)*b;}  //  最小公倍数lcm
int mypow(int x, int n, int m){  //  累乗x^n(mod m)  O(log(n))
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}
int scomb(int n, int r){  //  nCr (小さい場合)
int a=1;for(int i=n;i>n-r;--i){a=a*i;}for(int i=1;i<r+1;++i){a=a/i;}return a;}
int comb(int n, int r){  //  nCr (%MOD)
int a=1;for(int i=n;i>n-r;--i){a=a*i%MOD;}for(int i=1;
i<r+1;++i){a=a*mypow(i,MOD-2,MOD)%MOD;}return a%MOD;}
int stpow(int n){  //  階乗
if(n==0)return 1;int a=1;rep(i,1,n+1)a=a*i%MOD;return a;}
Vi stpowV(){Vi a(100001);  //  階乗配列(%MOD)
a[0]=1;repeq(i,1,100000)a[i]=a[i-1]*i%MOD;return a;}
void press(auto &v){v.erase(unique(ALL(v)),v.end());}  //  圧縮

map<int,Vi> black;



int f(int p,int q){
  int are=0;
  are += SMALLER(black[p-1],q+2);
  are -= SMALLER(black[p-1],q-1);
  are += SMALLER(black[p],q+2);
  are -= SMALLER(black[p],q-1);
  are += SMALLER(black[p+1],q+2);
  are -= SMALLER(black[p+1],q-1);
  return are;
}



signed main() {
  cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
  int h,w,n;
  cin >> h >> w >> n;
  Vi ans(10),memo(9);
  
  
  ans[0] = (h-2)*(w-2);
  int qw,er,are,zx;
  Vi ng(4);  //  上下左右
  
  rep(i,0,n){
    memo = Vi(9,-1);
    cin >> qw >> er;
    qw--,er--;
    ng = {0,0,0,0};
    
    if(qw==1) ng[0] = 1;
    else if(qw==0) ng[0] = 2;
    
    if(qw==h-2) ng[1] = 1;
    else if(qw==h-1) ng[1] = 2;
    
    if(er==1) ng[2] = 1;
    else if(er==0) ng[2] = 2;
    
    if(er==w-2) ng[3] = 1;
    else if(er==w-1) ng[3] = 2;
    
    //今から9個の処理
    
    if(ng[0]==0 && ng[2]==0) {
      memo[0] = f(qw-1,er-1);
    }
    if(ng[0]==0 && ng[2]<=1 && ng[3]<=1) {
      memo[1] = f(qw-1,er);
    }
    if(ng[0]==0 && ng[3]==0) {
      memo[2] = f(qw-1,er+1);
    }
    if(ng[0]<=1 && ng[1]<=1 && ng[2]==0) {
      memo[3] = f(qw,er-1);
    }
    if(ng[0]<=1 && ng[1]<=1 && ng[2]<=1 && ng[3]<=1) {
      memo[4] = f(qw,er);
    }
    if(ng[0]<=1 && ng[1]<=1 && ng[3]==0) {
      memo[5] = f(qw,er+1);
    }
    if(ng[1]==0 && ng[2]==0) {
      memo[6] = f(qw+1,er-1);
    }
    if(ng[1]==0 && ng[2]<=1 && ng[3]<=1) {
      memo[7] = f(qw+1,er);
    }
    if(ng[1]==0 && ng[3]==0) {
      memo[8] = f(qw+1,er+1);
    }
    
    //ここまで
    
    rep(i,0,9){
      if(memo[i] >= 0){
        ans[memo[i]]--;
        ans[memo[i]+1]++;
      }
    }
    
    zx = SMALLER(black[qw],er);
    black[qw].insert(black[qw].begin()+zx,er);
    /*
    black[qw].pb(er);
    sort(ALL(black[qw]));
    */
  }
  rep(i,0,10) cout << ans[i] << endl;
  return 0;
}

Measured memory_bytes: 42496