What is the number of all possible ways of distributing 16 DIFFERENT candies in a group consisting of 2 male and 4 female students if each male student receives at most 3 sweets?
I have no idea how to use this principle in this case. When I did a similar task in which the condition was that each boy gets at least one candy it was easy but I don't know how to do it for "at most 3"