import sys
from collections import deque

inputs = sys.stdin.readline

"""再帰関数のときセット
sys.setrecursionlimit(10**7)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
"""


def main():
    N, K = map(int, inputs().split())
    A = list(map(int, inputs().split()))
    left_que = deque()
    right_que = deque()
    same_cnt = 0
    for i in range(N - 1):
        if A[i] > A[i + 1]:
            for _ in range(same_cnt + 1):
                left_que.append(i)
            same_cnt = 0
        elif A[i] < A[i + 1]:
            for _ in range(same_cnt + 1):
                right_que.appendleft(i)
            same_cnt = 0
        else:
            same_cnt += 1
    for _ in range(same_cnt + 1):
        left_que.append(N - 1)

    # print(left_que)
    # print(right_que)

    if len(left_que) >= K:
        idx = left_que[K - 1]
        print(*A[:idx], *A[idx + 1:])
    else:
        idx = right_que[K - 1 - len(left_que)]
        print(*A[:idx], *A[idx + 1:])


if __name__ == '__main__':
    main()