1. To avoid empty boxes, we apply Stirling numbers of the second kind to divide the five balls into three groups (boxes).
2. The count of these partitions is \(S(5, 3)\), where \(S(n, k)\) denotes the Stirling number of the second kind. Using the formula:
\(S(5, 3) = 25.\)
3. As the boxes vary in size, we can arrange the groups into boxes in \(3! = 6\) ways.
4. Therefore, the total number of arrangements is:
\(S(5, 3) \cdot 3! = 25 \cdot 6 = 150.\)