A certain university will select 1 of 9 candidates eligible to fill a position in the mathematics department and 2 of 15 candidates eligible to fill 2 identical positions in the computer science department. If none of the candidates is eligible for a position in both departments, how many different sets of 3 candidates are there to fill the 3 positions? Select the correct option.
A) 351
B) 425
C) 748
D) 854
E) 945
1C9*2C15 = 9*105= 
<gadget id="calculator">9*105</gadget>
<output>945</output>
945   the answer is (945)
<result>E</result>
A certain university will select 1 of 9 candidates eligible to fill a position in the mathematics department and 2 of 15 candidates eligible to fill 2 identical positions in the computer science department. If none of the candidates is eligible for a position in both departments, how many different sets of 3 candidates are there to fill the 3 positions?