Consider a set of $n=9$ labeled items to be placed into $k=3$ unlabeled boxes. If each box must contain at least $2$ items, how many ways can this be done?