#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    ll n, k;
    cin>>n>>k;
    ll s=0;
    for(ll i=1; i<n; i++){
        s+=i;
    }
    if(k<n-1 || k>s){
        cout<<-1<<endl;
        return 0;
    }
    if(k==n-1){
        for(ll i=1; i<=n; i++){
            cout<<i;
            if(i<n) cout<<" ";
        }
        cout<<endl;
        return 0;
    }
    for(ll i=1; i<n-1; i++){
        if(s-i<=k){
            deque<int> ans;
            int v=1;
            for(int j=0; j<k-(s-i)+1; j++){
                ans.push_front(v);
                v++;
            }
            for(int j=0; j<i+1-(k-(s-i)); j++){
                ans.push_back(v);
                v++;
            }
            int j=0;
            while(v<=n){
                if(j&1) ans.push_back(v);
                else ans.push_front(v);
                v++; j++;
            }
            int ans1[1000010];
            for(int j=1; j<=n; j++){
                ans1[ans[j-1]]=j;
            }
            for(int j=1; j<=n; j++){
                cout<<ans1[j];
                if(j<n) cout<<" ";
            }
            cout<<endl;
            return 0;
        }
        s-=i;
    }
    return 0;
}