/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.18 20:02:41
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n, m;
    cin >> n >> m;
    vector< tuple< int, int, char > > a(m);
    vector< tuple< int, int, char, int > > b(m);
    for (int i = 0; i < m; i++) {
        int l, r;
        char t;
        cin >> l >> r >> t;
        l--;
        r--;
        a[i] = make_tuple(l, r, t);
        b[i] = make_tuple(l, r, t, i);
    }
    sort(b.begin(), b.end());
    set< pair< int, int > > st1;  
    set< int > st2;               
    int now = 0;
    int cnt_Y = 0, cnt_K = 0, cnt_C = 0;
    for (int i = 0; i < n; i++) {
        while (now < m && get< 0 >(b[now]) <= i) {
            st1.insert({get< 1 >(b[now]), get< 3 >(b[now])});
            st2.insert(get<3>(b[now]));
            now++;
        }
        while(!st1.empty() && (*st1.begin()).first < i) {
            st2.erase((*st1.begin()).second);
            st1.erase(st1.begin());
        }
        if (st2.empty()) continue;
        char c = get<2>(a[*st2.begin()]);
        if (c == 'Y') cnt_Y++;
        else if (c == 'K') cnt_K++;
        else cnt_C++;
    }
    cout << cnt_Y << " " << cnt_K << " " << cnt_C << endl;
    return 0;
}