Scheduling Appointments

You have $n \geq 2$ students that you need to see $k$ times each over the next month. You have $nk$ total appointment spots available for students to select from. However, one of the students can't attend in the first time slot. How many different ways can these students be scheduled when $n = 4$ and $k = 3$.