import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto M = RD;
	auto LRT = new long[][](M);
	auto num = ['Y':0, 'K':1, 'C':2];
	foreach (i; 0..M)
	{
		auto l = RD-1;
		auto r = RD;
		auto t = RD!string;
		LRT[i] = [l, r, num[t[0]]];
	}

	auto next = new long[](N);
	next[] = -1;
	auto ans = new long[](N);
	ans[] = -1;
	foreach (i; 0..M)
	{
		long j = LRT[i][0];
		while (j < LRT[i][1])
		{
			if (ans[j] == -1)
			{
				ans[j] = LRT[i][2];
				next[j] = LRT[i][1];
				++j;
			}
			else
			{
				j = next[j];
			}
		}
	}
	long[] cnt = [0, 0, 0];
	foreach (e; ans)
	{
		if (e == -1) continue;
		++cnt[e];
	}

	cnt.map!(to!string).join(" ").writeln;
	stdout.flush;
	debug readln;
}