题目描述
Problem Description
Aoi, a student at JOI High School, found a scroll in the library. The scroll contains a string $S$ of length $N$, where each character in the string is either j, o, i, J, O, or I.
Since taking the scroll out is prohibited, Aoi decided to copy the string $S$ entirely. The string Aoi wrote down is $T$.
However, Aoi mistakenly reversed the case of the characters from the $K$-th character (including the $K$-th character) onwards. That is, for $1 \leq i \leq K-1$, the $i$-th character of $S$ is the same as the $i$-th character of $T$, and for $K \leq i \leq N$, if the $i$-th character of $S$ is uppercase, the $i$-th character of $T$ is lowercase, and if the $i$-th character of $S$ is lowercase, the $i$-th character of $T$ is uppercase.
Given the string $T$, its length $N$, and the value $K$, write a program to restore the string $S$ that was written on the scroll.
Input Format
The input is given from the standard input in the following format:
$N$ $K$ $T$
Output Format
Output the string $S$ that was written on the scroll to the standard output in one line.
Sample Input and Output
Sample Input #1
3 2
Joi
Sample Output #1
JOI
Sample Input #2
1 1
O
Sample Output #2
o
Sample Input #3
6 3
JoIOji
Sample Output #3
JoioJI
Notes/Hints
Constraints
- $1 \leq K \leq N \leq 100$.
- $T$ is a string of length $N$.
- Each character in $T$ is either
j,o,i,J,O, orI. - $N$ and $K$ are integers.
Subtasks
- ($30$ points) $N = 1$, $K = 1$.
- ($70$ points) No additional constraints.
Grading Notes
All submissions are graded on the judge system.
The submitted source code is considered correct for a subtask if it returns the correct result for all test inputs corresponding to that subtask.
The score for each submission is the sum of the points for the subtasks that the submitted source code solved correctly.
The score for this task is the maximum score of all submissions for this task.
The current score can be checked from the "My Score" tab in the "Submission Results".
输入格式
见题面 Input 部分
输出格式
见题面 Output 部分