The input permutation perm can be given as a permutation list or in disjoint cyclic form.
For cyclic input Cycles the cycles must be lists of positive integers representing the points of the domain in which the permutation perm acts. The cycles must have no common points.
PermutationList returns a permutation list that is a reordering of the consecutive integers . By default the length len is the largest integer present in the input perm.
For an input cycle the resulting permutation list has point at position and at position .