#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, char> P;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

struct node{
	int id,chl,chr,l,r;
	P v;
};

int n,s = 0;
node t[816225];
P ans[225816];

int init(int l=0, int r=n){
	int id;
	id = s; ++s;
	t[id].l = l; t[id].r = r;
	t[id].id = id; t[id].v = P(n,'@');
	if(r-l>1){
		t[id].chl = init(l,(l+r)/2);
		t[id].chr = init((l+r)/2,r);
	}
	return id;
}

void update(int a, int b, P v, int i=0, int l=0, int r=n){
	if(b<=l || r<=a){
		return;
	}else if(a<=l && r<=b){
		t[i].v = min(t[i].v,v);
	}else{
		update(a,b,v,t[i].chl,l,(l+r)/2);
		update(a,b,v,t[i].chr,(l+r)/2,r);
	}
}

int main(void){
	int m,i,l,r,y=0,k=0,c=0,j;
	char ch;
	cin >> n >> m;
	init();
	for(i=0; i<m; ++i){
		cin >> l >> r >> ch;
		update(l-1,r,P(i,ch));
	}
	for(i=0; i<n; ++i){
		l = 0; r = n;
		j = 0; ans[i] = t[j].v;
		while(r-l>1){
			m = (r+l)/2;
			if(i<m){
				j = t[j].chl;
				r = m;
			}else{
				j = t[j].chr;
				l = m;
			}
			ans[i] = min(ans[i],t[j].v);
		}
	}
	for(i=0; i<n; ++i){
		switch(ans[i].second){
			case 'Y':
			++y; break;
			case 'K':
			++k; break;
			case 'C':
			++c; break;
		}
	}
	cout << y << " " << k << " " << c << endl;
	return 0;
}