PROGRAMMING:Partial sorting
For a set of data, we can sort only those elements that were originally in the middle.
###Input format:
Enter 'n r A1, A2... An' in one line < br > and
Where, a positive integer 'n' not greater than 200 represents the number of data in the group; A non negative integer 'R' not greater than 200 indicates that there are 'R' numbers left at both ends of the set of data not to be sorted. If 'R + R > = n', the set of data does not need to be sorted< br>
The integer 'A1, A2... An' is the group's' n 'data, all within 8 bits.
###Output format:
In the sequence after sorting, there is a space between the elements, and there is no space after the last element.
###Input example:
```in
5 1 6 5 4 3 2
```
###Output example:
```out
6 3 4 5 2
```
answer：If there is no answer, please comment
###Input format:
Enter 'n r A1, A2... An' in one line < br > and
Where, a positive integer 'n' not greater than 200 represents the number of data in the group; A non negative integer 'R' not greater than 200 indicates that there are 'R' numbers left at both ends of the set of data not to be sorted. If 'R + R > = n', the set of data does not need to be sorted< br>
The integer 'A1, A2... An' is the group's' n 'data, all within 8 bits.
###Output format:
In the sequence after sorting, there is a space between the elements, and there is no space after the last element.
###Input example:
```in
5 1 6 5 4 3 2
```
###Output example:
```out
6 3 4 5 2
```
answer：If there is no answer, please comment