#include<bits/stdc++.h>

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pii pair<int,int>

#define C 0.5772156649

#define pi acos(-1.0)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f3f;

int a[N],b[N],k,res;

void rmergesort(int l,int r)

{

    if(l==r||k<=)return ;

    k-=;

    int m=(l+r)>>;

    if((r-l)%==)m--;

  //  cout<<l<<" "<<m<<" "<<r<<endl;

    int ans=a[m+],id=m+;

    for(int i=m;i>=l;i--)

    {

        if(ans>a[i])

        {

            ans=a[i];

            id=i;

            break;

        }

    }

    swap(a[id],a[m+]);

    rmergesort(l,m);

    rmergesort(m+,r);

}

void mergesort(int l,int r)

{

    res++;

    bool f=;

    for(int i=l+;i<=r;i++)

    {

        if(a[i]<a[i-])

        {

            f=;

            break;

        }

    }

    if(!f)return ;

    int m=(l+r)>>;

    if((r-l)%==)m--;

    mergesort(l,m);

    mergesort(m+,r);

    int p1=l,p2=m+,i=l;

    while(i<=r)

    {

        if(p1>m)b[i]=a[p2++];

        else if(p2>r)b[i]=a[p1++];

        else

        {

            if(a[p1]>a[p2])b[i]=a[p2++];

            else b[i]=a[p1++];

        }

        i++;

    }

    for(int i=l;i<=r;i++)

        a[i]=b[i];

}

int main()

{

    int n;

    scanf("%d%d",&n,&k);

    for(int i=;i<=n;i++)a[i]=i;

    k--;

    rmergesort(,n);

    if(k!=)puts("-1");

    else

    {

        for(int i=; i<=n; i++)

            printf("%d ",a[i]);

        puts("");

    }

  /*  res=0;

    mergesort(1,n);

    for(int i=1;i<=n;i++)

        printf("%d ",a[i]);

    puts("");

    cout<<k<<" "<<res<<endl;*/

    return ;

}

/********************

********************/