Counting Defective Parking Functions

In the morning all available parking spaces are empty
due to parking restriction. Throughout the day visitors
arrive one by one each heading for a specific address.

All visitors use the same strategy to find a parking space:
they drive up to their destination and try to use the parking
space directly in front of it and stay until the night
(parking spaces are marked, i.e., discrete). If the preferred
parking space is taken a visitor drives past it and uses the
next available space. If all remaining spaces are occupied
the visitor leaves in dismay.

Given n, m, and k, what is the number of ways m visitors can
be assigned to n parking spaces such that under above parking
strategy exactly k visitors have to leave? How many people will
not find a parking space? And how many
drivers have to arrive until the parking space if full?