#include <iostream>
#include <algorithm>
using namespace std;
struct Ans
{
	char c;
	int now;
	int next;
};
bool cmp(Ans x,Ans y)
{
	if (x.c!=y.c)
	{
		return x.c<y.c;
	}
	else
	{
		return x.now>y.now;
	}
}
int p,q;
Ans s[10005],u[10005];
int main()
{
	cin >> p;
	for (int i=0;i<p;i++)
	{
		cin >> s[i].c;
		s[i].now=i;
	}
	cin >> q;
	for (int i=0;i<p;i++)
	{
		u[i].c=s[i].c;
		u[i].now=i;
	}
	sort (s,s+p,cmp);
	for (int i=0;i<p;i++)
	{
		u[i].next=s[i].now;
	}
	cout << u[q-1].c;
	int j=q-1;
	for (int i=1;i<p;i++)
	{
		cout << u[u[j].next].c;
		j=u[j].next;
	}



	return 0;
 }