#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n,p;
string s, s2, ans;
char tmp;
char a[10005];
int main() {
	cin >> n >> s >> p;
	p--;
	for(int i = 0; i < n; i++) a[i] = s[i];
	sort(a, a+n);
	for(int i = 0; i < n; i++) s2 += a[i];
	int cnt = 1;
	for(int i = 0; i < n; i++){
		if(s2[i] == s[p]){
			tmp = s[i];
			break;
		}
	}
	while(cnt < n){
		for(int i = 0; i < n; i++){
			if(s[p] == s2[i] && p != i){
				ans += s[i];
				p=i;
				cnt++;
				break;
			}
		}
	}
	ans += tmp;
	reverse(ans.begin(), ans.end());
	cout << ans << endl;
}