from collections import Counter

h, w, n = list(map(int, input().split()))

d = Counter()

for _ in range(n):

    a, b = list(map(int, input().split()))

    for i in range(3):

        for j in range(3):

            if w > b+j-1 > 1 < a+i-1 < h:

                d[(a+i,b+j)] += 1

ans = Counter()

for i in list(d.values()):

    ans[i] += 1

print(((h-2)*(w-2) - sum(ans.values())))

for i in range(1,10):

    print((ans[i]))
i=lambda:map(int,input().split())

h,w,n=i()

r=[0,1,2]

d={} 

while n:

    a,b=i();n-=1

    for j in r:

        for k in r:

            if w>=b+k>2<a+j<=h:d[(a+j,b+k)]=d.get((a+j,b+k),0)+1

c=[0]*10

for i in d:c[d[i]]+=1

c[0]=(h-2)*(w-2)-sum(c)

print(*c,sep="\n")

from collections import Counter

h, w, n = list(map(int, input().split()))
d = Counter()
for _ in range(n):
    a, b = list(map(int, input().split()))
    for i in range(3):
        for j in range(3):
            if w > b + j - 1 > 1 < a + i - 1 < h:
                d[(a + i, b + j)] += 1
ans = Counter()
for i in list(d.values()):
    ans[i] += 1
print(((h - 2) * (w - 2) - sum(ans.values())))
for i in range(1, 10):
    print((ans[i]))

i = lambda: map(int, input().split())
h, w, n = i()
r = [0, 1, 2]
d = {}
while n:
    a, b = i()
    n -= 1
    for j in r:
        for k in r:
            if w >= b + k > 2 < a + j <= h:
                d[(a + j, b + k)] = d.get((a + j, b + k), 0) + 1
c = [0] * 10
for i in d:
    c[d[i]] += 1
c[0] = (h - 2) * (w - 2) - sum(c)
print(*c, sep="\n")

-from collections import Counter - -h, w, n = list(map(int, input().split())) -d = Counter() -for _ in range(n): -    a, b = list(map(int, input().split())) -    for i in range(3): -        for j in range(3): -            if w > b + j - 1 > 1 < a + i - 1 < h: -                d[(a + i, b + j)] += 1 -ans = Counter() -for i in list(d.values()): -    ans[i] += 1 -print(((h - 2) * (w - 2) - sum(ans.values()))) -for i in range(1, 10): -    print((ans[i])) +i = lambda: map(int, input().split()) +h, w, n = i() +r = [0, 1, 2] +d = {} +while n: +    a, b = i() +    n -= 1 +    for j in r: +        for k in r: +            if w >= b + k > 2 < a + j <= h: +                d[(a + j, b + k)] = d.get((a + j, b + k), 0) + 1 +c = [0] * 10 +for i in d: +    c[d[i]] += 1 +c[0] = (h - 2) * (w - 2) - sum(c) +print(*c, sep="\n")