The various procedures of enumerating all outcomes of an allocation scheme with a given constraint are considered; one-to-one correspondence between the outcomes and their numbers is established; possible values of the scheme’s implementation are simulated. Proceeding from this analysis, results can then be obtained for permutations of any cycle structure with dispersion constrained by the same number as the steps in our scheme if the allocations are interpreted as consecutive mappings in its cycles.