A given range of fixed elements of a permutation means a certain number of elements between the elements located at the extremes in the permutation in each sequence. The proposed scheme is analyzed in the pre-asymptotic region of feasible parameter values using the enumerative method designed by the author, i. e., the enumerative combinatorics problems of finding the number of its outcomes, their non-repeated numbered enumeration, finding one-to-one correspondence between the types of outcomes and their numbers, determining the probabilities of outcomes are solved and a procedure for their universal modelingis proposed.