$[4$ points$]$ We need to arrange $8$ students into $3$ different queues $()($queue A$,$ queue B$,$ queue C$).$ The number of students the queues can be different, any of the three queues can be empty, and the order of the students within a queue matters $($s$)$ How many ways to form the queues? Answer as an expression; final answer is not needed. You can type the expression as in $\frac{c}{C}++.$