A sampling (or coupon collecting) problem. Consider an urn that contains rM balls, for given integers rand M. Suppose that for each integer j, 1 to M, exactly r balls bear the integer j. Find the probability that in a sample of size n (in which n ≥ M), drawn without replacement from the urn, exactly m of the integers 1 to M will be missing.