#include <bits/stdc++.h>
using namespace std;
int main() {
	int N, M;cin >> N >> M;
	set<int> non;
	for (int i = 1;i <= N;i++) non.insert(i);
	vector<int> ans(3, 0);
	while (M--) {
		int l, r;char c;cin >> l >> r >> c;
		int v = 0;
		if (c == 'K') {
			v = 1;
		} else if (c == 'C') {
			v = 2;
		}
		auto itr = non.lower_bound(l);
		vector<int> er;
		while (itr != non.end()) {
			if (*itr > r) break;
			er.push_back(*itr);
			itr++;
		}
		for (auto nv : er) non.erase(nv);
		ans[v] += (int)er.size();
	}
	cout << ans[0] << " "<< ans[1] << " " << ans[2] << endl;
}