PROGRAMMING:bubble sort
Bubble sorting, which sorts $$n $$integers from small to large, works by comparing two adjacent elements from beginning to end and swapping them if the preceding element is larger than the following one. Through a scan, the last element must be the largest. Then the first $$n-1 $$elements are scanned a second time in the same way. And so on, in the end, you only need to process two elements to complete the sorting of the number of $$n $.
This problem requires that for any given $$k $$($< n $$), the intermediate result sequence after scanning the $$k $$.
###Input format:
Enter $$n $$and $$k $$($$1 / Le K < n / Le 100 $$) in line 1, and $$n $$integers to be sorted in line 2, separated by spaces.
###Output format:
Output the middle result sequence of bubble sorting method after scanning the $$k $$pass in one row. The numbers are separated by spaces, but there must be no extra spaces at the end.
###Input example:
```in
6 2
2 3 5 1 6 4
```
###Output example:
```out
2 1 3 4 5 6
```
answer：If there is no answer, please comment
This problem requires that for any given $$k $$($< n $$), the intermediate result sequence after scanning the $$k $$.
###Input format:
Enter $$n $$and $$k $$($$1 / Le K < n / Le 100 $$) in line 1, and $$n $$integers to be sorted in line 2, separated by spaces.
###Output format:
Output the middle result sequence of bubble sorting method after scanning the $$k $$pass in one row. The numbers are separated by spaces, but there must be no extra spaces at the end.
###Input example:
```in
6 2
2 3 5 1 6 4
```
###Output example:
```out
2 1 3 4 5 6
```
answer：If there is no answer, please comment