Primeness of generalized parking functions

Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a direct sum of prime ones. In this article, we extend the notion of primeness to three generalizations of classical parking functions: vector parking functions, $(p,q)$-parking functions, and two-dimensional vector parking functions. We study their enumeration by obtaining explicit formulas for the number of prime vector parking functions when the vector is an arithmetic progression, prime $(p,q)$-parking functions, and prime two-dimensional vector parking functions when the weight matrix is an affine transformation of the coordinates.