import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt(); const M = readInt(); auto L = new int[M]; auto R = new int[M]; auto T = new string[M]; foreach (i; 0 .. M) { L[i] = readInt() - 1; R[i] = readInt(); T[i] = readToken(); } auto adds = new int[][N + 1]; auto rems = new int[][N + 1]; foreach (i; 0 .. M) { adds[L[i]] ~= i; rems[R[i]] ~= i; } auto set = new RedBlackTree!int; int[3] ans; foreach (x; 0 .. N) { foreach (i; adds[x]) { set.insert(i); } foreach (i; rems[x]) { set.removeKey(i); } if (!set.empty) { const i0 = set.front; ++ans["YKC".indexOf(T[i0][0])]; } } writeln(ans[0], " ", ans[1], " ", ans[2]); } } catch (EOFException e) { } }