A set of $n=6$ elements $\{1, 2, 3, 4, 5, 6\}$ is partitioned into $k=3$ non-empty, unlabeled subsets. How many ways can this be done? This is equivalent to calculating the Stirling number of the second kind, $S(6, 3)$.