from collections import deque
n,k = map(int,input().split())
A = list(map(int,input().split()))
q = deque([])
pos = 0
last = n+1
for i in range(n)[::-1]:
    a = A[i]
    if a > last:
        pos = 0
    elif a < last:
        pos = 1

    if pos:
        q.append(i)
    else:
        q.appendleft(i)
    last = a

pos = q[k-1]
ans = A[:pos]+A[pos+1:]
print(*ans)



# 8 10 7 9 4 2 5 1 6 3