class UnionFind
  def initialize(n)
    @size = Array.new(n, 1)
    @rank = Array.new(n, 0)
    @parent = []

    (0..n).each do |i|
      @parent[i] = i
    end
  end

  def find(x)
    if @parent[x] == x
      x
    else
      @parent[x] = find(@parent[x])
    end
  end

  def unite(x, y)
    x = find(x)
    y = find(y)
    return if x == y

    if @rank[x] < @rank[y]
      @parent[x] = y
      @size[y] += @size[x]
    else
      @parent[y] = x
      @size[x] += @size[y]

      @rank[x] += 1 if @rank[x] == @rank[y]
    end
  end

  def same?(x, y)
    find(x) == find(y)
  end

  def size(x)
    @size[find(x)]
  end
end

N, M = gets.split.map(&:to_i)
uf = UnionFind.new(N + 1)
memo = Array.new(N + 1)
G = Array.new(N + 1, -1)

M.times do
  l, r, t = gets.chomp.split
  l = l.to_i
  r = r.to_i

  from = uf.find(l)
  to = uf.find(r)

  from.upto(to) do |idx|
    uf.unite(from, idx)

    memo[idx] = t if memo[idx].nil?
  end
end

counter = Hash.new(0)
1.upto(N) do |idx|
  counter[memo[idx]] += 1
end

puts "%d %d %d" % [counter['Y'], counter['K'], counter['C']]