184 The $C M O$ is hosted by 6 universities in rotation for 8 consecutive sessions, with each university hosting at least one session, but no university can host more than one session in any consecutive three years (the $C M O$ is held annually), then the number of possible hosting schemes is $\qquad$ .
$18464 \times 6!=46080$. If we only consider "each university can host at most one session in any consecutive three years" (temporarily not considering "each university must host at least one session"), then there are 6 ways to choose the host for the first session, 5 ways for the second session, and 4 ways for each of the next 6 sessions. Then, consider three cases: "at least one university does not host any session", "at least two universities do not host any session", and "at least three universities do not host any session".

By the principle of inclusion-exclusion, the number of hosting schemes that meet the requirements $=C_{6}^{6} \times 6 \times 5 \times 4^{6}-C_{6}^{5} \times 5 \times 4 \times 3^{6}+C_{6}^{4} \times 4 \times 3 \times 2^{6}-C_{6}^{3} \times 3 \times 2 \times 1^{6}=46080$.