#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n,m,q;
    cin>>n>>m>>q;
    vector<int>ans(m,0);
    vector<int> xs;
    vector<array<int,3>>qu(q);
    for(int i=0;i<q;i++){
        cin>>qu[i][0]>>qu[i][1]>>qu[i][2];
        xs.push_back(qu[i][2]);
    }
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
    int qs=xs.size();
    vector<queue<int>>d(qs);
    for(int i=0;i<q;i++){
        if(qu[i][0]==1){
            int tmp=lower_bound(xs.begin(), xs.end(),qu[i][2])-xs.begin();
            d[tmp].push(qu[i][1]-1);
        }else{
            int tmp=lower_bound(xs.begin(), xs.end(),qu[i][1])-xs.begin();
            int per=d[tmp].front();
            ans[per]++;
            d[tmp].pop();
            tmp=lower_bound(xs.begin(), xs.end(),qu[i][2])-xs.begin();
            d[tmp].push(per);
        }
    }
    for(int i=0;i<m;i++){
        cout<<ans[i]<<endl;
    }
    return 0;
}