Minimum permutation

Given a natural number $n$ and non-negative integers k_1, k_2, \ldots, k_n such that

Your task is to construct the lexicographically smallest permutation of numbers from $1$ to $n$, such that in the decomposition of this permutation into non-overlapping cycles, there are k_1 cycles of length $1$, k_2 cycles of length $2$, ..., k_n cycles of length $n$. A permutation x = (x_1, x_2, \ldots, x_n) is lexicographically smaller than a permutation y = (y_1, y_2, \ldots, y_n) if there exists i \in \{1, 2, \ldots, n\} such that x_j = y_j for all 1 \leq j < i and x_i < y_i.