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

    S=[-1]*N
    L,R=1,N
    i=0; j=0
    while i<N:
        if i==N-1 or A[i]>A[i+1]:
            for k in range(j,i+1):
                S[k]=L
                L+=1
            j=i+1
        elif A[i]<A[i+1]:
            for k in range(j,i+1):
                S[k]=R
                R-=1
            j=i+1
        i+=1

    I=S.index(K)
    X=A.copy(); del X[I]
    return X

#==================================================
print(*solve())