from collections import deque

n, k = map(int, input().split())
A = list(map(int, input().split()))

Que = deque(range(1, n + 1))
cnt = 0
for i in range(n - 1):
    cnt += 1
    if A[i] > A[i + 1]:
        for _ in range(cnt):
            r = Que.popleft()
            if r == k:
                ANS = A[:i] + A[i + 1:]
                print(*ANS)
                exit()
        cnt = 0
    elif A[i] < A[i + 1]:
        for _ in range(cnt):
            r = Que.pop()
            if r == k:
                ANS = A[:i] + A[i + 1:]
                print(*ANS)
                exit()
        cnt = 0
print(*A[:-1])