This document discusses counting the number of ways to send k types of postcards with limited quantities of each type to n friends, where each friend can receive any number of cards including zero or multiple of the same card. The solution is that the number of ways is equal to the binomial coefficient of distributing ak + n - 1 objects into n - 1 slots.