#include <cstdio>
#include <fstream>

using namespace std;

int N, M;
int permut[1000];

int main()
{
    ifstream rfile("add.in");
    //scanf("%d %d", &N, &M);
    rfile >> N >> M;

    for(int i = 0;i < N;i++)
        rfile >> permut[i];

    int inverses = 0;

    for(int i = 0;i < N;i++)
        for(int j = i+1;j < N;j++)
            if(permut[i] > permut[j])
                inverses++;

    rfile.close();
    ofstream wfile("add.out");

    int npos = N - (M - inverses);
    if(inverses > M || npos < 0)
        wfile << "Impossible";
    else
    {
        for(int i = 0;i < N-1;i++)
        {
            if(i == npos)
                wfile << N+1 << " ";

            wfile << permut[i] << " ";
        }

        if(npos == N-1)
            wfile << N+1 << " ";

        wfile << permut[N-1];

        if(npos == N)
            wfile << " " << N+1;
    }

    wfile << endl;

    return 0;
}