import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import math
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
from collections import defaultdict
from collections import deque
#import copy #DeepCopy: hoge = [_[:] for _ in hogehoge]
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
dx = [1,0,-1,0]
dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

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

    def output(j):
        B = []
        for i,a in enumerate(A):
            if i == j: continue
            B.append(a)
        print(*B)
        exit()

    f = 1
    l = N
    s = 1
    for i in range(N-1):
        if A[i] == A[i+1]:
            s += 1
        elif A[i] > A[i+1]:
            pf = f
            f += s
            if pf <= K < f:
                output(i)
            s = 1
        else:
            pl = l
            l -= s
            if l < K <= pl:
                output(i)
            s = 1
        # print(f,l,s)
    output(N-1)


    

if __name__ == '__main__':
    main()