#include <iostream>
#include <vector>
#include <cmath>
#include <tuple>
#include <algorithm>

using namespace std;

int main() {
    int n, m; cin >> n >> m;
    int nn = sqrt(n+1)+1;
    vector<int> vs1(nn+1), vs2(n+1);
    vector<tuple<int,int,int,char>> ws(m);
    while (m--) {
        int l, r; char x; cin >> l >> r >> x;
        ws[m] = make_tuple(l, r, m+1, x);
    }
    for (auto &w : ws) {
        int l = get<0>(w), r = get<1>(w), x = get<2>(w);
        int ll = l / nn, rr = r / nn;
        for (int i = ll+1; i < rr; i++) {
            vs1[i] = max(vs1[i], x);
        }
        if (ll == rr) {
            for (int i = l; i <= r; i++) {
                vs2[i] = max(vs2[i], x);
            }
        } else {
            for (int i = l; i < (ll+1)*nn; i++) {
                vs2[i] = max(vs2[i], x);
            }
            for (int i = rr*nn; i <= r; i++) {
                vs2[i] = max(vs2[i], x);
            }
        }
    }
    int yc = 0, kc = 0, cc = 0;
    for (int i = 1; i <= n; i++) {
        int j = max(vs1[i/nn], vs2[i]);
        if (j > 0) {
            switch (get<3>(ws[j-1])) {
            case 'Y': yc++; break;
            case 'K': kc++; break;
            case 'C': cc++; break;
            }
        }
    }
    cout << yc << " " << kc << " " << cc << endl;
    return 0;
}