A word is an ordered, non-empty sequence of letters, such as $word$ or $wrod$. How many distinct 3-letter words can be made from a subset of the letters \(c, o, m, b, o\), where each letter in the list is used no more than the number of times it appears?

Let's think step by step and output the final answer within \boxed{}.
user