Mr. Cocktail get a string contain  characters. The character in the string from left to right respective marked as . This string consists of lowercase letters only.

Cocktail can perform unlimited times exchange operations on this string. Each operation can choose two digits , satisfying , and exchange the letters in these two positions----That is, .
Cocktail hopes that the lexicographical order of this string after several exchanges is the smallest. Now given this string and , please output a string representing the smallest lexicographical order that Cocktail can achieve after several operations.

In the first line, input three integer, indicating , the meaning is shown in the statement. 

The next line input a string  of length .Represents the initial string.

Output a string representing the smallest lexicographical string reached after several operations with follow the rules as statement describe. 

5 1 1
edcba

abcde

5 4 4
edcba

adcbe