from collections import deque
import sys
def input():
  return sys.stdin.readline()[:-1]
N,K=map(int,input().split())
A=list(map(int,input().split()))
front=deque()
back=deque()
tmp=1
flg=0
for i in range(N-1):
  if A[i]>A[i+1]:
    for j in range(tmp):
      front.append(i)
    if i==N-2: back.appendleft(N-1)
    tmp=1
    flg=0
  elif A[i]<A[i+1]:
    for j in range(tmp):
      back.appendleft(i)
    if i==N-2: front.append(N-1)
    tmp=1
    flg=1
  else:
    tmp+=1
    if i==N-2:
      for j in range(tmp):
        if flg==0: back.appendleft(N-1)
        else: back.append(N-1)
k=(front+back)[K-1]
ans=[A[i] for i in range(N) if i!=k]
print(*ans)