Split Sort Permutation

Given a parameter $K$, we define a recursive process on an array $A$ of size $M$ as follows: 1) If $M = 1$, return $A$. 2) Choose an index $i$ such that $1 \leq i \leq \min(M - 1, K)$. 3) Let $P = A[1,i]$ and $Q = A[(i + 1),M]$. Repeat the process from step $1$ for the arrays $P$ and $Q$ to get $P_1$ and $Q_1$. 4) Concatenate $P_1$ and $Q_1$ in any order to get $A_1$, i.e., either place all