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
# -*- coding: utf-8 -*-
"""
Created on Mon Jul  9 07:06:47 2018

@author: Ahmed
"""

# -*- coding: utf-8 -*-
"""
Éditeur de Spyder

Ceci est un script temporaire.
"""


##### 
import sys
from bisect import insort, bisect_right
data = sys.stdin.readlines()

lis = []

for line in data:
    lis.append(line)
#######
def dadd(key, elm, dic):
    """add a key and a value to a dictionary even if the key doesn't exist"""
    if key in dic:
        dic[key] += 1
    else:
        dic[key] = 1
    return dic

alphabet = 'abcdefghijklmnopqrstuvwxyz'

###
n, k = list(map(int, lis[0].split()))
string = list(lis[1])

#n, k = 15, 3
#string = list('cccaabababaccbc')
#n, k = 400000, 399999
#string = list('fqmznshmlbddkwjcyshcgylotzqpmfijzrafwuovvlvbnhwpucnvbloxreumexgtqpmvwyupuywrzasysigbhrlimqaszijhbkuubgagsoskfiazztamnmggldxyboykziwhnambaniiskhhravbvrsnhvbjrkadizirhzikbgstgkffupbxjjhztaeovraukenwomvxnqrambqzwcmfiwvypnbguziaqzdvyqesgyoxeudoqibkjjdyftschhjhfkzvkcwnrjzrbhdbxgciefciubamyqfpbwtvjqjlcshnxrdyrqampyduvrkxrcjxmtxuprsgfmtzwdgakgbbelbqelcybalteksuecnofdbsioipdgucnzjurhkgbtktorwyfbixnzfxhoxyxcxusfgyggeybffxbkcfnamdrtbptpmmyyyjirqaeiceqljvxozaegfblrtfucoywotyueccibgtholkmqtqntbjwuzgemwy')



if string[-1] == "\n": string = string[:-1]
bol_string = [1]*len(string)
if n -k == 1:
    indices = {char:0 for char in alphabet}
    for i in range(n):#create a dictionary of letters indices 
        indices[string[i]] += 1
    indices = sorted(list(indices.items()), key = lambda x: x[0])
    indices = [tup for tup in indices if tup[1] != 0]
    print(indices[-1][0])
    sys.exit()

indices = {char:[0, []] for char in alphabet}
for i in range(n):#create a dictionary of letters indices #o(n)
#    indices[string[i]][0] +=1
    indices[string[i]][1].append(i)
#indices = sorted(list(indices.items()), key = lambda x: x[0])

for char in alphabet:
    if k == 0: break#no letters to be removed
    length = len(indices[char][1]) 
    if k >= length:
        k -= length
        for i in range(length):
            j = indices[char][0]
            ind = indices[char][1][j]#remove an index
            indices[char][0] += 1
            #shift = bisect_right(removed, ind)#how many shifts we have to preform
            #insort(removed, ind) #add removed index
            bol_string[ind] = 0
            
    elif k< length:
        
        for i in range(k):
            j = indices[char][0]
            ind = indices[char][1][j]#remove an index
            indices[char][0] += 1
            #shift = bisect_right(removed, ind)#how many shifts we have to preform
            #insort(removed, ind) #add removed index
            bol_string[ind] = 0
        k = 0
    else: print("WTF")
result = ''.join([string[i] for i in range(n) if bol_string[i]])
print(result)
#for i in range(k): #k letters removal
#    for char in alphabet:
#        if len(indices[char])>= 1: 
##            print("-------------")
##            print(char)
##            print(indices)
#            ind = indices[char].pop(0)#remove an index
#            shift = bisect_right(removed, ind)#how many shifts we have to preform
#            insort(removed, ind) #add removed index
#            string.pop(ind-shift)
#            break

        


