#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; typedef pair PP; class RUQ{ public: int t[555555],v[555555],k; void init(){ k=0; memset(t,0,sizeof(t)); memset(v,0,sizeof(v)); } void update(int a,int b,int x) { v[k]=x; update2(a,b,k); k++; } void update2(int a,int b,int x,int k=0,int l=0,int r=1<<18){ if(b<=l||r<=a)return; if(a<=l&&r<=b){t[k]=max(t[k],x);return;} int m=(l+r)/2; update2(a,b,x,k*2+1,l,m); update2(a,b,x,k*2+2,m,r); } int query(int i){ i+=(1<<18)-1; int res=t[i]; while(i){ i=(i-1)/2; res=max(res,t[i]); } return v[res]; } }; RUQ t; void Main() { t.init(); int n,m; cin >> n >> m; PP a[m]; rep(i,m) { char c; cin >> a[i].F.F >> a[i].F.S >> c; if(c=='Y') a[i].S=1; else if(c=='K') a[i].S=2; else a[i].S=3; } t.update(0,n,0); rrep(i,m) { t.update(a[i].F.F-1,a[i].F.S,a[i].S); } int ans[3]; mem(ans); rep(i,n) { int x=t.query(i); if(x) ans[x-1]++; } PR(ans,3); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}