#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <sstream>
#include <regex>
#include <fstream>
#include <array>
#include <atcoder/all>

using namespace atcoder;
using mint = modint1000000007;
//using mint = modint998244353;
//using mint = modint;
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using vpint = vector<pint>;
using vvpint = vector<vpint>;
using vmint = vector<mint>;
using vvmint = vector<vmint>;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#pragma region GCD
ll gcd(ll a, ll b)
{
	if (b == 0)return a;
	return gcd(b, a % b);
}
#pragma endregion
#pragma region LCM
ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}
#pragma endregion
#pragma region グリッド内チェック
bool out(int x, int y, int h, int w)
{
	if (x < 0 || h <= x || y < 0 || w <= y)return true;
	else return false;
}
#pragma endregion
#pragma region Dijkstra
vl dijkstra(vector<vector<pair<int, ll>>> v, int s)
{
	ll INF = 1e18;
	int MAX = 1e6;
	vl res(MAX, INF);
	priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
	q.push({ 0,s });
	while (!q.empty())
	{
		int now;
		ll d;
		tie(d, now) = q.top();
		q.pop();
		if (!chmin(res[now], d))continue;
		for (auto p : v[now])
		{
			int next;
			ll c;
			tie(next, c) = p;
			if (res[next] <= res[now] + c)continue;
			q.push({ res[now] + c,next });
		}
	}
	return res;
}
#pragma endregion
#pragma endregion


int main()
{
	int n, m; cin >> n >> m;
	set<pint> s;
	s.insert({ n,1 });
	map<char, int> mp;
	mp['Y'] = 0;
	mp['K'] = 1;
	mp['C'] = 2;
	vi res(3);
	while (m--)
	{
		int l, r; cin >> l >> r;
		char t; cin >> t;
		vpint v, u;
		auto it = s.lower_bound({ l,0 });
		for (; it != s.end(); ++it)
		{
			int a, b; tie(b, a) = *it;
			if (a < l && r < b)
			{
				res[mp[t]] += r - l + 1;
				v.push_back({ l - 1, a });
				v.push_back({ b, r + 1 });
				u.push_back({ b, a });
			}
			else if (l <= a && a <= r && r < b)
			{
				res[mp[t]] += r - a + 1;
				v.push_back({ b, r + 1 });
				u.push_back({ b,a });
			}
			else if (l <= a && b <= r)
			{
				res[mp[t]] += b - a + 1;
				u.push_back({ b,a });
			}
			else if (a < l && l <= b && b <= r)
			{
				res[mp[t]] += b - l + 1;
				v.push_back({ l - 1,a });
				u.push_back({ b,a });
			}
			if (r < a)break;
		}
		for (auto p : u)s.erase(p);
		for (auto p : v)s.insert(p);
	}
	cout << res[0] << " " << res[1] << " " << res[2] << endl;
}