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

#define rep(i, a, b) for (int i = a; i < b; i++)
using ll = long long;

int main(){
	int n, m, q;
	cin >> n >> m >> q;
    vector<int> t(q), x(q), y(q);
    map<int, int> mp;
    rep(qi, 0, q) {
        cin >> t[qi] >> x[qi] >> y[qi];
        x[qi]--, y[qi]--;
        if(t[qi] == 1) mp[x[qi]]++;
    }
    int k = 0;
    for(auto it = mp.begin(); it != mp.end(); it++) {
        it->second = k++;
    }
    vector<queue<int>> dq(k);
    vector<int> d(m);
	rep(i, 0, q) {

        if(t[i] == 1) dq[mp[y[i]]].push(x[i]);
        else {
            int j = dq[mp[x[i]]].front();
            d[j]++;
            dq[mp[x[i]]].pop();
            dq[mp[y[i]]].push(j);
        }
    }
    rep(i, 0, m) cout << d[i] << endl;
}