Geongong String

You are given positive integers $N$ and $K$, and a string $S$ of length $N$ made of lowercase English letters.

Define reverse(i) as the operation that reverses the substring of $S$ formed by the characters at positions $i, i+1, \ldots, i+K-1$.

Perform reverse(i) for $i = 1, 2, \cdots, N-K+1$ in that order. The final string after all these operations is called the geongong string. Print it.

The first line contains two integers $N$ and $K$, separated by a space. ($1 \le K \le N \le 500\ 000$)

The second line contains the string $S$ of length $N$, made of lowercase English letters only.

Print the geongong string.