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?
- [(1)] $1$
- [(2)] $2$
- [(3)] $3$
- [(4)] $4$