#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;
}