import sys
input = sys.stdin.readline

N,K=map(int,input().split())
A=list(map(int,input().split()))
def solve(N,K,A):
    k=0
    i=0
    back=[]
    while i<N-1:
        if A[i]>A[i+1]:
            k+=1
        elif A[i]<A[i+1]:
            back.append(i)
        elif A[i]==A[i+1]:
            j=i
            a=A[i]
            while j<N-1 and a==A[j+1]:
                j+=1
            if j<N-1 and a<A[j+1]:
                for l in range(i,j+1):
                    back.append(l)
            else:
                k+=(j-i+1)
            i=j
        if k>=K:
            ans=A[:i]+A[i+1:]
            return ans
        i+=1
    if K-k==1 and A[-2]>A[-1]:
        return A[:-1]
    else:back.append(N-1)
    if A[-2]==A[-1]:back.pop()
    i = back[-(K-k)]
    ans=A[:i]+A[i+1:]
    return ans
print(*solve(N,K,A))