#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return -1;
}
template <typename T>
string make_string(T N)
{
    string ret;
    T now = N;
    while (now > 0)
    {
        T x = now % 10;
        ret += (char)('0' + x);
        now /= 10;
    }
    reverse(all(ret));
    return ret;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
template <typename T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[9] = {0, 1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[9] = {0, 0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));

int main()
{
    cout << fixed << setprecision(30);
    ll H, W, N;
    cin >> H >> W >> N;
    vector<ll> a(N), b(N);
    /*
    方針
    (x,y)が黒マスのとき、(x,y)を中心とする3*3の正方形の各マスについて
    そのマスがグリッドの端(正方形の中心となりえない)or探索済みならcontinue
    そのマスを中心とする3*3の正方形に含まれる黒マスの数をカウントしてcount[黒マスの数]++
    seen[そのマス]=true
    count[0]は、count[1]~count[9],H,Wから分かる
    */
    vector<ll> count(10);          //答え
    map<pair<ll, ll>, bool> exist; //そのマスが黒マスか
    map<pair<ll, ll>, bool> seen;  //そのマスを中心として探索済みか
    //(x,y)について、x<=1||x>=H||y<=1||y>=Wなら(x,y)はグリッドの端(または外)
    loop(i, N)
    {
        cin >> a[i] >> b[i];
        exist[make_pair(a[i], b[i])] = true;
    }
    loop(i, N)
    {
        ll x = a[i], y = b[i];
        loop(d, 9)
        {
            ll nx = x + dx[d], ny = y + dy[d];
            if (nx <= 1 || nx >= H || ny <= 1 || ny >= W)
                continue;
            if (seen[make_pair(nx, ny)])
                continue;
            //さらにこのマスを中心に探索
            ll c = 0;
            loop(dd, 9)
            {
                ll nnx = nx + dx[dd], nny = ny + dy[dd];
                if (exist[make_pair(nnx, nny)])
                    c++;
            }
            count[c]++;
            seen[make_pair(nx, ny)] = true;
        }
    }
    ll nowS = Sum(count);
    count[0] = (H - 2) * (W - 2) - nowS;
    loop(i, 10) putout(count[i]);
    return 0;
}


Measured memory_bytes: 217156