/**
	author:  shobonvip
	created: 2026.08.25 13:59:53
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll n, m;
	cin >> n >> m;

	vector<ll> ans(m);
	map<ll,vector<ll>> mp;
	map<ll,ll> piv;
	ll q; cin >> q;
	while(q--) {
		int t; cin >> t;
		if (t == 1) {
			ll i; cin >> i; i--;
			ll g; cin >> g;
			mp[g].emplace_back(i);
		} else {
			ll s, t;
			cin >> s >> t;
			ll x = mp[s][piv[s]];
			ans[x]++;
			piv[s]++;
			mp[t].emplace_back(x);
		}
	}

	rep(i,0,m) {
		cout << ans[i] << '\n';
	} 
}