Robust Singleton Coupons After Random Draws

A collector draws $m$ coupons independently and uniformly at random from $n$ types. A coupon type is called a singleton if it appears exactly once among the $m$ draws. Find the expected number of singleton types.

Additional robustness twist: before observation, an independent random relabeling of outcome labels is applied. Compute the same target and justify invariance.