#include<bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> perm(n), pos(n+1, 0);
for (int i = 0; i < n; i++) {
cin >> perm[i];
pos[perm[i]] = i + 1;
}
/*for (int i = 0; i <= n; i++) {
cout << pos[i] << " ";
}*/
//max -> pos,,, i -> perm
for (int max = n, i = 0, swaps = 0; max > 0 && i < n && swaps < k; max--, i++) {
int maxpos = pos[max];
if (perm[i] != max) {
swap(perm[i], perm[maxpos - 1]);
pos[max] = i + 1;
pos[perm[maxpos - 1]] = maxpos;
swaps++;
}
}
for (int i = 0; i < n; i++) {
cout << perm[i] << " ";
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKSB7CglpbnQgbiwgazsKCWNpbiA+PiBuID4+IGs7Cgl2ZWN0b3I8aW50PiBwZXJtKG4pLCBwb3MobisxLCAwKTsKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJY2luID4+IHBlcm1baV07CgkJcG9zW3Blcm1baV1dID0gaSArIDE7Cgl9CgkvKmZvciAoaW50IGkgPSAwOyBpIDw9IG47IGkrKykgewoJCWNvdXQgPDwgcG9zW2ldIDw8ICIgIjsKCX0qLwoJLy9tYXggLT4gcG9zLCwsIGkgLT4gcGVybQoJZm9yIChpbnQgbWF4ID0gbiwgaSA9IDAsIHN3YXBzID0gMDsgbWF4ID4gMCAmJiBpIDwgbiAmJiBzd2FwcyA8IGs7IG1heC0tLCBpKyspIHsKCQlpbnQgbWF4cG9zID0gcG9zW21heF07CgkJaWYgKHBlcm1baV0gIT0gbWF4KSB7CgkJCXN3YXAocGVybVtpXSwgcGVybVttYXhwb3MgLSAxXSk7CgkJCXBvc1ttYXhdID0gaSArIDE7CgkJCXBvc1twZXJtW21heHBvcyAtIDFdXSA9IG1heHBvczsKCQkJc3dhcHMrKzsKCQl9Cgl9Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewoJCWNvdXQgPDwgcGVybVtpXSA8PCAiICI7Cgl9CglyZXR1cm4gMDsKfQ==