#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;


template <typename T, typename Func>
class DualSegmentTree{
private:
  int size;
  std::vector<T> data;
  const T e;
  const Func f;
  
  inline void propagate(int i){
    if(i < size/2){
      data[i*2+1] = f(data[i], data[i*2+1]);
      data[i*2+2] = f(data[i], data[i*2+2]);
      data[i] = e;
    }
  }
  
  inline void update_aux(int s, int t, int i, int l, int r, const T &x){
    if(r <= s || t <= l) return;
    else if(s <= l && r <= t) data[i] = f(x, data[i]);
    else{
      propagate(i);
      update_aux(s,t,i*2+1,l,(l+r)/2,x);
      update_aux(s,t,i*2+2,(l+r)/2,r,x);
    }
  }
  
  inline void get_aux(int i){
    if(i>0) get_aux((i-1)/2);
    propagate(i);
  }
  
public:
  DualSegmentTree(int n, const T &e, const Func &f): e(e), f(f){
    size = 1;
    while(size < n) size *= 2;
    size = size*2-1;
    data = std::vector<T>(size, e);
  }

  inline void update(int s, int t, const T &x){
    update_aux(s,t,0,0,size/2+1,x);
  }

  inline T get(int i){
    int j = i+size/2;
    get_aux((j-1)/2);
    return data[j];
  }
};



template <typename T, typename Func>
class DualSegmentTreeRangeUpdate : public DualSegmentTree<std::pair<T, bool>, Func>{
  using super = DualSegmentTree<std::pair<T, bool>, Func>;

public:
  DualSegmentTreeRangeUpdate(int n, const T &e, const Func f): super(n, std::make_pair(e, false), f){}

  inline void update(int l, int r, const T &val){
    super::update(l, r, std::make_pair(val, true));
  }

  inline T get(int i){
    auto val = super::get(i);
    return val.first;
  }
};

template <typename T>
auto make_dual_segment_tree_range_update(int size, const T &e){
  auto f = [](const auto &a, const auto &b){return a.second ? a : b;};
  return DualSegmentTreeRangeUpdate<T, decltype(f)>(size, e, f);
}





int main(){
  int N, M;
  while(cin >> N >> M){
    vector<int> L(M), R(M);
    vector<char> T(M);
    REP(i,M) cin >> L[i] >> R[i] >> T[i];

    auto seg = make_dual_segment_tree_range_update<char>(N, ' ');

    REV(i,M-1,0){
      seg.update(L[i]-1, R[i], T[i]);
    }
    
    int Y = 0, K = 0, C = 0;
    REP(i,N){
      char a = seg.get(i);

      cerr << a << " ";
      
      if(a == 'Y') Y += 1;
      if(a == 'K') K += 1;
      if(a == 'C') C += 1;
    }

    cerr << endl;

    
    
    
    cout << Y << " " << K << " " << C << endl;
  }

  return 0;
}