// #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predictive-commoning")
// #pragma GCC option("D_GLIBCXX_PARALLEL","openmp")

// #pragma GCC optimize("O3")
// #pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
// #define int long long
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000               // 2e9
#define LLINF 2000000000000000000ll  // 2e18 (llmax:9e18)
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define dmp(x) cerr << #x << ": " << x << endl;

template <class T>
void chmin(T &a, const T &b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T &a, const T &b) {
  if (a < b) a = b;
}

template <class T>
using MaxHeap = priority_queue<T>;
template <class T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T>
vector<T> vect(int len, T elem) {
  return vector<T>(len, elem);
}

template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.fi << ',' << p.sec;
  return os;
}
template <class T, class U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.fi >> p.sec;
  return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  for (int i = 0; i < vec.size(); i++) {
    os << vec[i];
    if (i + 1 < vec.size()) os << ' ';
  }
  return os;
}
template <class T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (int i = 0; i < vec.size(); i++) is >> vec[i];
  return is;
}
void fastio() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
}

#define endl "\n"
ll extgcd(ll a, ll b, ll &x, ll &y) {
  ll g = a;
  x = 1;
  y = 0;
  if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
  return g;
}

void solve() {
  ll H, W;
  int N;
  cin >> H >> W >> N;
  vector<P> ps(N);
  cin >> ps;
  auto b = vect(9, P(0, 0));
  set<P> s;
  for (P p : ps) { s.insert(p); }
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) { b[i * 3 + j] = P(i, j); }
  }
  vector<ll> ans(10, 0ll);
  for (int i = 0; i < 9; i++) {
    for (P p : ps) {
      int cnt = 0;
      for (int j = 0; j < 9; j++) {
        P pos = b[i];
        P pos2 = b[j];
        P q = p;
        q.first += pos2.first - pos.first;
        q.second += pos2.second - pos.second;
        if (q.first <= 0 || q.first > H || q.second <= 0 || q.second > W) {
          cnt = -INF;
          break;
        }
        if (s.find(q) != s.end()) cnt++;
      }
      if (cnt >= 1 && cnt < 10) ans[cnt]++;
    }
  }
  ll sum = 0ll;
  for (int i = 1; i < 10; i++) {
    assert(ans[i] % i == 0);
    ans[i] /= i;
    sum += ans[i];
  }
  ans[0] = (H - 2) * (W - 2) - sum;
  for (ll ele : ans) cout << ele << endl;
  return;
}

signed main() {
  fastio();
  solve();
  // int t; cin >> t; while(t--)solve();

  // int t; cin >> t;
  // for(int i=1;i<=t;i++){
  //   cout << "Case #" << i << ": ";
  //   solve();
  // }
  return 0;
}


Measured memory_bytes: 8740