#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/


/********************************
 *
 * 平方分割
 *
 *******************************/
class SquareRootDecomposition {
    vector<int> S; // 少ない方
    vector<int> T; // 多い方
    int K;
    
public:
    SquareRootDecomposition(int size) {
        T = vector<int>(size, 0);
        K = sqrt(size);
        S = vector<int>(size/K+1, 0);
    }
    
    void add(int l, int r, int w) {
        while(l < r) {
            int lk = l / K;
            int rk = r / K;
            if (lk == rk) {
                FOR(j, l, r) {
                    T[j] = (get(j) > 0) ? get(j) : w;
                }
            }
            else if (l % K == 0) {
                S[lk] = (S[lk] > 0) ? S[lk] : w;
            }
            else {
                FOR(j, l, (lk+1)*K) {
                    T[j] = (get(j) > 0) ? get(j) : w;
                }
            }
            l = (lk+1)*K;
        }
    }
    
    int get(int l) {
        return (T[l] > 0) ? T[l] : S[l / K];
    }
};

int N,M,Q;

void solve() {
    cin>>N>>M;
    
    auto s = SquareRootDecomposition(N);
    int l,r;
    char T;
    map<const char, int> tmap = {
        {'Y', 1},
        {'K', 2},
        {'C', 3},
    };
    while(M--) {
        cin>>l>>r>>T;
        s.add(l-1,r,tmap[T]);
    }
    map<int, int> cnts;
    REP(i,N) {
        cnts[s.get(i)]++;
    }
    
    cout << cnts[1] << " " << cnts[2] << " " << cnts[3] << endl;
}