You are given a string s consisting of n lowercase Latin letters. Polycarp wants to remove exactly k characters (k ≤ n) from the string s. Polycarp uses the following algorithm k times:

  * if there is at least one letter 'a', remove the leftmost occurrence and stop the algorithm, otherwise go to next item; 
  * if there is at least one letter 'b', remove the leftmost occurrence and stop the algorithm, otherwise go to next item; 
  * ... 
  * remove the leftmost occurrence of the letter 'z' and stop the algorithm. 



This algorithm removes a single letter from the string. Polycarp performs this algorithm exactly k times, thus removing exactly k characters.

Help Polycarp find the resulting string.

Input

The first line of input contains two integers n and k (1 ≤ k ≤ n ≤ 4 ⋅ 10^5) — the length of the string and the number of letters Polycarp will remove.

The second line contains the string s consisting of n lowercase Latin letters.

Output

Print the string that will be obtained from s after Polycarp removes exactly k letters using the above algorithm k times.

If the resulting string is empty, print nothing. It is allowed to print nothing or an empty line (line break).

Examples

Input

15 3
cccaabababaccbc


Output

cccbbabaccbc


Input

15 9
cccaabababaccbc


Output

cccccc


Input

1 1
u


Output
n, k = map(int, input().split())
s = input()
D = dict()
ch = 'a'
for i in range(26):
    D[ch] = 0
    ch = chr(ord(ch) + 1)   

for sym in s:
    D[sym] += 1
    
to_del = dict()

ch = 'a'
r = k
for i in range(26):
    if D[ch] < r:
        to_del[ch] = D[ch]
    else:
        to_del[ch] = r
    r = r - to_del[ch]
    ch = chr(ord(ch) + 1) 
    if r == 0:
        break


ans = [1] * n
for i in range(len(ans)):
    if s[i] in to_del.keys() and to_del[s[i]] > 0:
        to_del[s[i]] -= 1
        ans[i] = 0
answer = ''
for i in range(len(ans)):
    if ans[i] == 1:
        answer += s[i]
print(answer)        