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 = list(map(int, input().strip().split()))

s = input()

occurences = []
for i in range(26):
	occurences.append([])

if(k >= len(s)):
	pass

else:
	for i in range(n):
		occurences[ord(s[i]) - 97].append(i)

	to_delete = []
	
	for occurence in occurences:
		for item in occurence:
			to_delete.append(item)

	li = list(s)
	
	count = 0
	for ind in to_delete:
		if count == k:
			break
		li[ind] = '1'
		count += 1

	li[:] = (value for value in li if value != '1')

	s = ''.join(li)
	print(s)