///by Saton.
#include<bits/stdc++.h>
#define PI acos(-1)
#define fi first
#define se second 
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define int long long
#define ll __int128
#define DD double double
#define LD long double
#define rep(i,a,b) for(int i = (a);i <= (b);i ++)
#define lep(i,a,b) for(int i = (a);i >= (b);i --)
#define FLUSH fflush(stdout)
using namespace std;
typedef pair<int,int> PII;
const int N = 1e6 + 10,mod = 998244353;
int n,m,k;
void solve() {
    cin >> n >> m >> k;
    vector<vector<int>> group(n+1);
    map<int,int> mp;
    vector<int> val(n+1),ans(m+1);
    while(k --) {
        int op,x,y;
        cin >> op >> x >> y;
        if(op==1) {
            group[y].push_back(x);
            mp[x*1000000+y] = val[y];
        }
        else if(op==2) {
            group[y].erase(find(all(group[y]),x));
            ans[x] += val[y] - mp[x*1000000+y];
        }
        else {
            mp[x*1000000+y] ++;
            val[y] ++;
        }
    }
    
    rep(i,1,n) {
        for(auto j : group[i]) {
            ans[j] += val[i] - mp[j*1000000+i];
        }
    }
    
    rep(i,1,m) cout << ans[i] << '\n';
} 

signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    // int T;
    // cin >> T;
    // while(T --) {
    //     solve();
    // }
    solve();
       
    return 0;
}  
/*   /\_/\
*   (= ._.)
*   / >  \>
*/