Problem: a certain university will select 1 of 8 candidates eligible to fill a position in the mathematics department and 2 of 12 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 ?
Rationale: "1 c 8 * 2 c 12 = 8 * 66 = 528 the answer is ( d )"
annotated_formula: multiply(multiply(12, 3), 8)