Concept:
- Instead of selecting the whole group of 5 students first and then arranging all of them together, decide which of the 5 non-leftmost seats go to Section B and which go to Section C, then separately select and arrange students into each set of designated seats.
- Selecting $r$ distinct people out of $n$ and arranging them, in order, into $r$ specific seats can be counted directly with the permutation formula $^nP_r = \dfrac{n!}{(n-r)!}$, without splitting it into a separate "choose" step and "arrange" step.
Step 1: Fill the leftmost seat with a Section A student.
Any of the 3 Section A students can sit there: 3 ways.
Step 2: Decide which of the remaining 5 seats belong to Section B.
Choose 3 of the 5 remaining seats to be "B seats" (the other 2 automatically become "C seats"): $\binom{5}{3} = 10$ ways.
Step 3: Fill the 3 B-seats, in order, with 3 of the 5 Section B students.
$^5P_3 = 5 \times 4 \times 3 = 60$ ways.
Step 4: Fill the remaining 2 C-seats, in order, with 2 of the 4 Section C students.
$^4P_2 = 4 \times 3 = 12$ ways.
Step 5: Multiply every independent choice together.
$3 \times 10 \times 60 \times 12 = 21600$
Final Answer: $21600$