You are given a string $S$ of length $N$.

What string is formed if we reverse the order of the characters from the $A$-th character to the $B$-th character of $S$, while leaving the other characters unchanged? Here, the first character of $S$ is the $1$-st character, and the last character is the $N$-th character.

Given the string $S$ and $2$ integers $A, B$, write a program to output the string formed by reversing the order of the characters from the $A$-th character to the $B$-th character of $S$.

Input

The input is given from Standard Input in the following format:

$$ \begin{aligned} &N \ A \ B \\ &S \end{aligned} $$

Output

Output on $1$ line the string formed by reversing the order of the characters from the $A$-th character to the $B$-th character of $S$.

Constraints

• $1 \le A \le B \le N \le 200$.
• $S$ is a string of length $N$.
• Each character of $S$ is an uppercase or lowercase English letter.

Examples

Input 1

10 3 7
JOIjoiJoIj

Output 1

JOJiojIoIj

Input 2

9 6 6
abcdefghi

Output 2

abcdefghi

Note 2

• It is possible that $A = B$.