Suppose that m drivers each choose a preferred parking space in linear car park with n spots. In order, driver goes to their chosen spot and parks there if possible, otherwise takes the next available it exists. If all successfully, sequence of choices is called function. Classical functions correspond case $$m=n$$ ; we study here combinatorial probabilistic aspects this generalized case. We co...