from collections import deque
N,K=map(int,input().split())
A=list(map(int,input().split()))
d=deque()
ans=[-1]*N
l=0
r=N-1
res=[]
for i in range(N-1):
    if A[i]>A[i+1]:
        res.append(i)
        while res:
            j=res.pop()
            ans[l]=j
            l+=1
    elif A[i]<A[i+1]:
        res.append(i)
        while res:
            j=res.pop()
            ans[r]=j
            r-=1
    else:
        res.append(i)
while res:
    j=res.pop()
    ans[l]=j
    l+=1
ans[l]=N-1
ans_seq=[]
for i in range(N):
    if i!=ans[K-1]:
        ans_seq.append(A[i])
print(*ans_seq)