#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
bool inside(int y,int x,int h,int w){
	if(y<h && y>=0 && x<w && x>=0) return true;
	return false;
}


struct A{
	int l,r,t,i;
};

bool cmp(A a, A b){
	if(a.l == b.l) return a.i < b.i;
	return a.l < b.l;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n,m;cin >> n >> m;
	vector<int> a(n);
	vector<A> b(m);
	rep(i,m){
		A c;
		char d;
		cin >> c.l >> c.r >> d;
		c.l--;
		c.r--;
		c.i = i;
		if(d == 'Y') c.t = 1;
		else if(d == 'K') c.t = 2;
		else c.t = 3;
		b.at(i) = c;
	}
	sort(b.begin(),b.end(),cmp);
	int it = 0;
	priority_queue<pair<pii,pii>, vector<pair<pii,pii>>, greater<pair<pii,pii>>> pq;
	rep(i,n){
		while(it < m && b.at(it).l == i){
			pq.push(mp(mp(b.at(it).i,b.at(it).t),mp(b.at(it).l,b.at(it).r)));
			it++;
		}
		while(!pq.empty() && pq.top().second.second < i){
			pq.pop();
		}
		if(!pq.empty()){
			a.at(i) = pq.top().first.second;
		}
	}
	vector<int> cnt(4);
	rep(i,n) cnt.at(a.at(i))++;
	cout << cnt.at(1) << " " << cnt.at(2) << " " << cnt.at(3) << endl;
}