PROGRAMMING:K-round bubble sorting
As we all know, ZWG is a Dalao, and JZK is a Laji. Now JZK asks ZWG, can you sort n numbers in bubble order from small to large? ZWG thinks this problem is very simple, and then asks JZK, can you output the result of k-round bubble sorting on the basis of this? JZK thinks this problem is very difficult, so he asks you for advice. Can you solve this problem for JZK?
Give you n numbers, output these n numbers after K round bubble sorting results.
Through a scan, the last element must be the largest. Then the first n − 1 element is scanned a second time with the same method.
###Input format:
Input n and K (1 ≤ K < n ≤ 100) in line 1, and N integers to be sorted in line 2, separated by spaces.
###Output format:
Output the intermediate result sequence after the k-th time of bubble sorting scanning 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
Give you n numbers, output these n numbers after K round bubble sorting results.
Through a scan, the last element must be the largest. Then the first n − 1 element is scanned a second time with the same method.
###Input format:
Input n and K (1 ≤ K < n ≤ 100) in line 1, and N integers to be sorted in line 2, separated by spaces.
###Output format:
Output the intermediate result sequence after the k-th time of bubble sorting scanning 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