/* -*- coding: utf-8 -*-
 *
 * 945.cc:  No.945 YKC饅頭 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_E2 = 1 << 19; // = 524288
const int MAX_M = 200000;

/* typedef */

enum { NA, Y, K, C };

template <typename T, const int MAX_E2>
struct SegTree {
  int n, e2;
  T nodes[MAX_E2];
  SegTree() {}

  void init(int _n) {
    n = _n;
    for (e2 = 1; e2 < n; e2 <<= 1);
  }

  T &get(int i) { return nodes[e2 - 1 + i]; }

  void setall() {
    for (int j = 0; j < e2 - 1; j++)
      if (nodes[j]) {
	nodes[j * 2 + 1] = nodes[j * 2 + 2] = nodes[j];
	nodes[j] = NA;
      }
  }

  void set_range(int r0, int r1, T v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      nodes[k] = v;
      return;
    }

    int k0 = k * 2 + 1, k1 = k0 + 1;
    if (nodes[k]) {
      nodes[k0] = nodes[k1] = nodes[k];
      nodes[k] = NA;
    }

    int im = (i0 + i1) / 2;
    set_range(r0, r1, v, k0, i0, im);
    set_range(r0, r1, v, k1, im, i1);
  }
  void set_range(int r0, int r1, T v) { set_range(r0, r1, v, 0, 0, e2); }
};

/* global variables */

int cmap[128];
int ls[MAX_M], rs[MAX_M], ts[MAX_M], cs[4];
SegTree<int,MAX_E2> st;

/* subroutines */

/* main */

int main() {
  cmap['Y'] = Y, cmap['K'] = K, cmap['C'] = C;

  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < m; i++) {
    char s[4];
    scanf("%d%d%s", ls + i, rs + i, s);
    ls[i]--;
    ts[i] = cmap[s[0]];
  }

  st.init(n);

  for (int i = m - 1; i >= 0; i--)
    st.set_range(ls[i], rs[i], ts[i]);

  st.setall();

  for (int i = 0; i < n; i++) cs[st.get(i)]++;
  printf("%d %d %d\n", cs[Y], cs[K], cs[C]);
  return 0;
}