N,M = map(int,input().split())
T = list(map(int,input().split()))
Hiany = []
for i in range(1,N+1):
    if i not in T:
        Hiany.append(i)
Elotte = T[:]
Talal = False
i = M-1
while i > 0 and not Talal:
    if Elotte[i] - Elotte[i-1] > 1:
        Elotte[i] = Elotte[i] - 1
        Vege = T[i:] + Hiany
        Vege.sort()
        Elotte = Elotte[:i+1] + Vege[len(Vege)-(M-i)+1:]
        Talal = True
    i -= 1
if Talal:
    print(*Elotte)
else:
    if T[0] == 1:
        for j in range(M):
            Elotte[j] = N-M+j+1
        print(*Elotte)
    elif T[0] > 1:
        Elotte[0] = Elotte[0] - 1
        Vege = []
        for j in range(N-M+2,N+1):
            Vege.append(j)
        Elotte = Elotte[:1] + Vege
        print(*Elotte)

Utana = T[:]
Hiany.sort()
VegenNovel = False
for k in Hiany:
    if k > Utana[-1]:
        VegenNovel = True
        Utana[-1] = k
        break
if not VegenNovel:
    Talal = False
    i = M-1
    while i > 0 and not Talal:
        if Utana[i] - Utana[i-1] > 1:
            Vege = T[i:] + Hiany
            Vege.sort()
            Utana = T[:i-1]
            for k in range(len(Vege)):
                if Vege[k] > T[i-1]:
                    Vege = Vege[k:]
                    break
            Utana += Vege[:M-i+1]
            Talal = True
        i -= 1
    if not Talal:
        for k in range(M):
            Utana[k] = k+1
print(*Utana)