def solution(number, k):
    num_len = len(number) - k
    stack = []

    for num in number :
        stack.append(num)
        while len(stack) >= 2 and k > 0 and stack[-1] > stack[-2] :
            stack.pop(-2)
            k -= 1
    return ''.join(stack[:num_len])