Number of combinations from 3 sets. Lets say I am given 3 sets:
$S_1 = \{a_1, a_2, a_3,...,a_{10}\}\quad$
$S_2 = \{b_1, b_2, b_3,...,b_8\}\quad$
$S_3 = \{c_1, c_2, c_3,...,c_5\}$
I am unsure how to find the total number of combinations if I am supposed to choose 2 elements from $S_1$, 2 elements from $S_2$ and 1 element from any of the sets. I am also unable to choose the same element twice in any combination.
An example of a combination could be $\{a_1, a_3, b_3, b_8, c_2\}$ where there is always 5 elements total out of 23 total elements.
My original answer was incorrect.
Any ideas? 
 A: *

*Choose two of $10$ from set $S_1$ ($10$-choose-$8$). 

*$\times$

*Choose two of $8$ from set $S_2$ ($8$-choose-$2$).

*$\times$

*For the fifth element, we choose $1$ from the $23 - 4 = 19$ remaining
elements, knowing $19$-choose-$1$ = $19$ choices.


$$\binom{10}{2}\times \binom{8}{2}\times [(23-4)]= \binom{10}{2}\times \binom{8}{2}\times (19) = \quad?$$
Recall: $$n-\text{choose}-k = \binom{n}{k} = \dfrac{n!}{k!(n-k)!}$$

Note: we need both "combinations": n-choose-k, or and the "rule of the product", to solve this problem. Both these tools need to become very familiar to you.
A: If you are supposed to choose 2 elements from $s_1$, 2 elements from $s_2$, and one element from any of the sets, you can at first choose 2 elements from $s_1$ in $\binom{10}{2}$ ways then you choose 2 elements from $s_2$ in $\binom{8}{2}$ ways . Now after choosing these four elements you are left with $23-4=19 $ elements from which you have to choose 1 element , which you can do in $\binom{19}{1}$ ways .
So the total no. of ways=$\binom{10}{2}.\binom{8}{2}.\binom{19}{1}$
A: So you have $C^2_{10}$ ways of choosing 2 elements of $S_1$, $C^2_8$ ways of choosing 2 elements of $S_2$, and finally 10+8+5-4=19 ways of choosing the last element. Hence you have 45.28.19=23940 combinations.
