In this paper, we study the excedance distribution over permutations while considering the parameters of cycle length and the number of cycles. We refer to the number of such permutations as the associated Stirling Eulerian number. Moreover, if we consider the permutations in which the first s integers are in different cycles, we denote their count as the associated s-Stirling Eulerian number. We provide a formula defining these numbers, along with their generating functions. We establish q-analogues and offer extensions of the results.