from collections import deque
n,k = map(int,input().split())
a = list(map(int,input().split()))
dq = deque([n-1])
for i in range(n-2,-1,-1):
    if a[i]<a[i+1]:dq.append(i)
    else: dq.appendleft(i)
a.pop(dq[k-1])
print(*a)