PROGRAMMING:Bubble sort(1)
The technique we use is called the **bubble sort **or **the sinking sort** because the smaller values gradually “bubble” their way upward to the top of the array like air bubbles rising in water, while the larger values sink to the bottom of the array. The technique is to make several passes through the array. On each pass, successive pairs of elements are compared. If a pair is in increasing order (or if the values are identical), we leave the values as they are. If a pair is in decreasing order, their values are swapped in the array.
In this question, for an atbitrary **K** (1<=K<=10), output the result after K passes.
### Input Specification:
Input 10 integer numbers in the first line, seperate each by a space;
the second line shows 1 integer number for K.
### Output Specification:
Outout the result after K passes in a line, seperate each by a space.
### Sample Input 1:
```in
20 8 86 84 83 81 57 67 86 40
five
```
### Sample Output 1:
```out
8 20 57 67 40 81 83 84 86 86
```
### Sample Input 2:
```in
7 5 15 84 3 77 9 26 48 55
three
```
### Sample Output 2:
```out
5 3 7 9 15 26 48 55 77 84
```
answer：If there is no answer, please comment
In this question, for an atbitrary **K** (1<=K<=10), output the result after K passes.
### Input Specification:
Input 10 integer numbers in the first line, seperate each by a space;
the second line shows 1 integer number for K.
### Output Specification:
Outout the result after K passes in a line, seperate each by a space.
### Sample Input 1:
```in
20 8 86 84 83 81 57 67 86 40
five
```
### Sample Output 1:
```out
8 20 57 67 40 81 83 84 86 86
```
### Sample Input 2:
```in
7 5 15 84 3 77 9 26 48 55
three
```
### Sample Output 2:
```out
5 3 7 9 15 26 48 55 77 84
```
answer：If there is no answer, please comment