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.appendleft(i) elif a[i]<a[i+1]: dq.append(i) elif dq[0]==i+1: dq.appendleft(i) else: dq.append(i) a.pop(dq[k-1]) print(*a)