/* -*- coding: utf-8 -*-
 *
 * 3641.cc:  No.3641 OHO SHI KA TSU・・aiting ver.・・- yukicoder
 */

#include<cstdio>
#include<map>
#include<queue>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_M = 100000;

/* typedef */

using qi = queue<int>;
using miqi = map<int,qi>;

/* global variables */

int cs[MAX_M];

/* subroutines */

/* main */

int main() {
  int n, m, qn;
  scanf("%d%d%d", &n, &m, &qn);

  miqi qs;
  while (qn--) {
    int op, u, v;
    scanf("%d%d%d", &op, &u, &v);
    u--, v--;

    if (op == 1) {
      qs[v].push(u);
    }
    else {
      auto &qu = qs[u], &qv = qs[v];
      int i = qu.front(); qu.pop();
      cs[i]++;
      qv.push(i);
    }
  }

  for (int i = 0; i < m; i++) printf("%d\n", cs[i]);
  
  return 0;
}