#include <bits/stdc++.h>
using namespace std;
long long h, w, n;
pair<long long, long long> p[100005];
long long ct[10];
map<pair<long long, long long>, long long> check;
map<pair<long long, long long>, long long> mp;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> h >> w >> n;
  for (long long i = 1; i <= n; ++i)
    cin >> p[i].first >> p[i].second, mp[p[i]] = 1;
  for (long long k = 1; k <= n; ++k) {
    for (long long x = max(p[k].first - 2LL, 2LL);
         x <= min(p[k].first + 2LL, h - 1LL); ++x) {
      for (long long y = max(p[k].second - 2LL, 2LL);
           y <= min(p[k].second + 2LL, w - 1LL); ++y) {
        pair<long long, long long> q;
        q.first = x;
        q.second = y;
        if (check[q] == 0) {
          check[q] = 1;
          long long cnt = 0;
          for (long long i = -1; i <= 1; ++i) {
            for (long long j = -1; j <= 1; ++j) {
              pair<long long, long long> t;
              t.first = x + i;
              t.second = y + j;
              if (mp[t] == 1) ++cnt;
            }
          }
          ++ct[cnt];
        }
      }
    }
  }
  long long sum = 0;
  for (long long i = 1; i <= 9; ++i) sum += ct[i];
  cout << (h - 2) * (w - 2) - sum << " ";
  for (long long i = 1; i <= 9; ++i) cout << ct[i] << " ";
}
