#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<math.h>
using namespace std;

#define official

#ifdef official
#define cin inF
#define cout outF
#endif

ifstream inF("add.in");
ofstream outF("add.out");

const int MAX_N=1000;

int n,m;
int a[MAX_N+100];
bool p=0;
int ans[MAX_N+100];

struct num
{
    int v,p;
};
bool cmp(num a, num b)
{
    return a.v>b.v;
}

num ns[MAX_N+100];

void input()
{
    cin>>n>>m;
    for (int i=0; i<n; ++i)
    {
        cin>>a[i];
    }
}
void output()
{
    if (p)
    {
        for (int i=0; i<n+1; ++i)
        {
            cout<<(i?" ":"")<<ans[i];
        }
        cout<<endl;
    }
    else
    {
        cout<<"Impossible"<<endl;
    }
}

int ind[MAX_N+100];
void update(int p, int a)
{
    ++p;
    while (p<=MAX_N+50)
    {
        ind[p]+=a;
        p+=p&(-p);
    }
}
int get(int p)
{
    ++p;
    int s=0;
    while (p>0)
    {
        s+=ind[p];
        p-=p&(-p);
    }
    return s;
}
void set0()
{
    for (int i=0; i<=MAX_N+50; ++i)
    {
        ind[i]=0;
    }
}
int test(int p)
{
    set0();
    int inv=0;
    for (int i=0; i<n+1; ++i)
    {
        if (ns[i].p>=p)
        {
            inv+=get(ns[i].p+1);
            update(ns[i].p+1,1);
        }
        else if (ns[i].p==-1)
        {
            inv+=get(p);
            update(p,1);
        }
        else
        {
            inv+=get(ns[i].p);
            update(ns[i].p,1);
        }
    }
    return inv;
}
void solve()
{
    for (int i=0; i<n; ++i)
    {
        ns[i].v=a[i];
        ns[i].p=i;
    }
    ns[n].v=n+1;
    ns[n].p=-1;
    sort(ns,ns+n+1,cmp);

    int l=0,r=n+1,valid=-1,mid,an;
    while (l<=r)
    {
        mid=(l+r)/2;
        an=test(mid);
        if (an==m)
        {
            valid=mid;
            break;
        }
        if (an<m)
        {
            r=mid-1;
        }
        if (an>m)
        {
            l=mid+1;
        }
    }
    if (valid==-1)
    {
        p=0;
        return;
    }
    p=1;
    for (int j=0; j<n+1; ++j)
    {
        if (j==valid) ans[j]=n+1;
        if (j>valid) ans[j]=a[j-1];
        if (j<valid) ans[j]=a[j];
    }
}

int main()
{
    input();
    solve();
    output();

    return 0;
}