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


def solve(string, k):
  indexes = {}
  
  banned = [False] * len(string)
  abc = 'abcdefghijklmnopqrstuvwxyz'
  abc_index = 0

  for i in reversed(range(len(string))):
    char = string[i]
    if char not in indexes:
      indexes[char] = [i]
    else:
      indexes[char].append(i)
  for j in range(k):
    char = abc[abc_index]
    while char not in indexes:
      abc_index += 1
      char = abc[abc_index]
    banned_index = indexes[char].pop()
    banned[banned_index] = True
    if len(indexes[char]) == 0:
      del indexes[char]
  new_string = ""
  for i in range(len(string)):
    if not banned[i]:
      new_string += string[i]
  return new_string




n, k = map(int, input().split())
string = input().rstrip("\r\n")

solution = solve(string, k)
print(solution)

