// yuki 945 YKC饅頭
// 2019.12.8 bal4u

#include <stdio.h>
#include <string.h>

typedef long long ll;

//// 入力の高速化
int getchar_unlocked();
#define gc() getchar_unlocked()

int in() {    // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

// セグメント木
#define MAXN (1<<18)      // セグメント木のサイズ。2のべき乗にすべし
#define INF  0x7777777777777777LL

ll segVal[2*MAXN];
ll segLazy[2*MAXN];

void lazy(int k, int l, int r) {
	if (segLazy[k] != INF) {
		segVal[k] = (r-l)*segLazy[k];
		if (l + 1 < r) {
			segLazy[(k << 1) + 1] = segLazy[k];
			segLazy[(k << 1) + 2] = segLazy[k];
		}
		segLazy[k] = INF;
	}
}

void update(int a, int b, ll x, int k, int l, int r) {
	lazy(k, l, r);
	if (r <= a || b <= l) return;
	if (a <= l && r <= b) {
		segLazy[k] = x;
		lazy(k, l, r);
		return;
	}
	update(a, b, x, (k << 1) + 1, l, (l + r) >> 1);
	update(a, b, x, (k << 1) + 2, (l + r) >> 1, r);
	segVal[k] = segVal[(k << 1) + 1] + segVal[(k << 1) + 2];
}

ll getSum(int a, int b, int k, int l, int r) {
	ll ans;

	if (r <= a || b <= l) return 0;
	lazy(k, l, r);
	if (a <= l && r <= b) return segVal[k];
	ans = getSum(a, b, (k << 1) + 1, l, (l + r) >> 1);
	ans += getSum(a, b, (k << 1) + 2, (l + r) >> 1, r);
	return ans;
}

#define T6  1000000
#define T12 1000000000000LL

ll x[128];
int L[200005], R[200005]; char T[200005];

int main()
{
	int i, N, M;
    ll s;

    x['Y'] = 1, x['K'] = T6, x['C'] = T12;
	N = in(), M = in();
//	memset(segLazy, 0x77, sizeof(segLazy));
    for (i = 0; i < 2*N; i++) segLazy[i] = INF;
	for (i = 0; i < M; ++i) {
		L[i] = in(), R[i] = in(), T[i] = gc(), gc();
    }
    while (i--) update(L[i]-1, R[i], x[T[i]], 0, 0, N);
    s = getSum(0, N+1, 0, 0, N);
	printf("%d %d %d\n", (int)(s%T6), (int)((s/T6)%T6), (int)(s/T12));
	return 0;
}