import collections
import heapq
import sys
from collections import defaultdict
from itertools import count

sys.setrecursionlimit(10 ** 6)
from typing import List, Tuple

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    n, m, q = vi()
    a = defaultdict(collections.deque)
    ans = [0] * m
    for i in range(q):
        v1, v2, v3 = vi()
        if v1 == 1:
            a[v3].append(v2)
        else:
            u = a[v2].popleft()
            ans[u - 1] += 1
            a[v3].append(u)
    for i in ans:
        print(i)


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()