| 2 | 3 | 1 |
| 3 | 1 | 2 |
| 1 | 2 | 3 |
\textbf{148 --} In a competition, 3 drivers participate for three consecutive days with 3 cars on routes A, B, and C. Each driver selects only one route and one car per day, and the scheduling is done in the form of a Latin square. In how many ways can the scheduling be done such that on the first day, no one selects car A?
\begin{center}
\begin{tabular}{|c|c|c|}
\hline
2 & 3 & 1 \\
\hline
3 & 1 & 2 \\
\hline
1 & 2 & 3 \\
\hline
\end{tabular}
\end{center}
\begin{itemize}
\item[(1)] $1$
\item[(2)] $2$
\item[(3)] $3$
\item[(4)] $4$
\end{itemize}