#include <iostream>
#include <fstream>

using namespace std;

int N,M,Ar[1001];

void init()
{
    int temp,i=0;
    ifstream read;
    read.open("add.in");
    read >> N >> M;
    while (i<N)
    {
        read >> Ar[i];
        i++;
    }
    read.close();
}

void solve()
{
    ofstream print;
    print.open("add.out");
    int inverses = 0;
    for (int i=1;i<N;i++)
        for (int j=0;j<i;j++) if (Ar[j]>Ar[i]) inverses++;

    if (inverses+N<M||inverses>M) print << "Impossible\n";
    else {
        for (int i=0;i<N;i++)
        {
            if (i==(N-(M-inverses))) print << N+1 <<" ";
            print << Ar[i] << " ";
        }
    }
    print.close();
}

int main(void)
{
    init();
    solve();
    return 0;
}