You have accepted an offer at VortaroEnMano Inc., a company committed to creating the most comprehensive Esperanto dictionary. Esperanto estas tre mojosa lingvo, so you work really hard to do your best – mostly to keep your job in the depression of employment.
Today, you're assigned to refactor the function called "Hodiaŭa Vorto", i.e. "Today's Word" in English. This word is generated from a string, denoted as $$$S_k$$$.
Here's how $$$S_k$$$ is generated:
The function $$$\text{next}(S)$$$ increments each character in the string $$$S$$$ to the next letter in the alphabet, i.e., $$$\texttt{a}$$$ changes to $$$\texttt{b}$$$, $$$\texttt{b}$$$ to $$$\texttt{c}$$$, and so on, with $$$\texttt{z}$$$ changing to $$$\texttt{a}$$$. For instance, $$$\text{next}(\texttt{abz})=\texttt{bca}$$$.
Your task is to determine the suffix of $$$S_{10^{100}}$$$ with a length of $$$m$$$.
The first line contains two integers $$$n$$$ and $$$m$$$ ($$$1 \le n, m \le 10^5$$$), representing the length of $$$S_0$$$ and the length of the desired suffix, respectively. It is guaranteed that $$$n$$$ is an even number.
The second line contains a string, $$$S_0$$$, composed of $$$n$$$ lowercase English letters.
Output a string of length $$$m$$$, which represents the suffix you are tasked to determine.
6 10 bocchi
wrwxrwxsxy
In the provided example, $$$S_1=\underline{\texttt{boc}}\ \underline{\texttt{bocchi}}\ \underline{\texttt{dij}}$$$.