Question 31
(MON 2) An urn contains balls of $k$ different colors; there are $n_i$ balls of the $i$th color. Balls are drawn at random from the urn, one by one, without replacement. Find the smallest number of draws necessary for getting $m$ balls of the same color.