Substring Reversals :
Difficulty Level : Easy
Submissions : 238
Asked In :
Marks :10
: 2 | : 1
Given a string $$$s$$$ of length $$$n$$$ and a positive integer k such that $$$1 \leq k \leq n$$$, find the lexicographically smallest string possible by reversing at most one substring of size $$$k$$$.
Input
The first line of input consists of 2 space separated integers $$$-$$$ $$$n$$$ and $$$k$$$. $$$(1 \leq k \leq n \leq 10^3)$$$. The second line of input consists of a string of length $$$n$$$ consisting of lowercase Latin letters.
Output
The output should consist a string of length $$$n$$$ - the lexicographically smallest string possible by reversing at most one substring of size $$$k$$$.
Example
Input
6 2 aadcb
Output
aacdb
