Cyclic shifts in permutation

You have a permutation P of integers 1, 2, ... , N. You want to change it a little. To do this, you choose an integer K that satisfies an inequality 2 ≤ K ≤ N. After that, you perform several (possibly, zero, if you're feeling lazy) cyclic shifts. For each cyclic shift you choose a K-length segment of the permutation P (let's denote it as Px, Px + 1, ..., Px + K - 2, Px + K - 1) and perform a cycl