Expected Value, Linearity & Advanced Probability · Challenge problem

A machine dispenses prize $A$, $B$, or $C$ with probabilities $\tfrac12,\tfrac13,\tfrac16$ respectively, independently each time. Find the expected number of dispenses until all three prizes have been collected.

The answer is a fraction $\tfrac{m}{n}$ in lowest terms; find $m + n$.