#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
//const ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
ll myctoi(char C) {return C - '0';}
char myitoc(ll N) {return '0' + N;}
#define FINALANS(A) {cout << (A) << '\n'; exit(0);}

int main()
{
  ll N, M;
  cin >> N >> M;

  set<ll> S;
  for (ll i = 1; i <= N; i++)
  {
    S.emplace(i);
  }

  map<char, ll> ans;
  for (ll i = 0; i < M; i++)
  {
    ll L, R;
    char T;
    cin >> L >> R >> T;

    auto itr = S.lower_bound(L);
    while (itr != S.end() && *itr <= R)
    {
      ans[T]++;

      auto itr0 = itr;
      itr0++;
      S.erase(itr);
      itr = itr0;
    }
  }
  cout << ans['Y'] << " " << ans['K'] << " " << ans['C'] << endl;
}