Non-Decreasing Subsequence of size K

You are given a positive integer $K$ and an array $A$ consisting of $N$ non-negative integers. Find the [lexicographically](https://en.wikipedia.org/wiki/Lexicographic_order) smallest sequence $B$ that satisfies the following conditions - We can obtain $B$ by rearranging the elements in $A$. - The length of longest non-decreasing [subsequence](https://en.wikipedia.org/wiki/Subsequence) of $B$ is