from collections import deque


N, K = map(int, input().split())
A = list(map(int, input().split()))

D = deque([N-1])
for i in reversed(range(N-1)):
    if A[i] > A[i+1]:
        D.appendleft(i)
    else:
        D.append(i)

del A[D[K-1]]
print(*A)