times 'Bubble operation'. One 'Bubble operation' is like this:

for(int i = 1; i < n; ++i) { if(a[i] > a[i + 1]) swap(a[i], a[i + 1]); }

The sequence starts from 1, and its length is n.

Submit: 680 Solved: 198

[Submit][Status][Web Board]

times 'Bubble operation'. One 'Bubble operation' is like this:

for(int i = 1; i < n; ++i) { if(a[i] > a[i + 1]) swap(a[i], a[i + 1]); }

The sequence starts from 1, and its length is n.

, which is the number of the test cases(1 <= T <= 10). For each test case, the first line will be two integers n and K(1 <= K <= n <= 200000). The second line will be n integers, a_{1}……a_{n}(1 <= a_{i} <= 10^{9}), representing the original sequence. It queries what the sequence is like after K times 'Bubble sort' from the original sequence.

For each query, print the sequence in one line, do not print extra space at the end of one line.

```
1
5 1
5 4 3 2 1
```

```
4 3 2 1 5
```