#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= l; i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

void experiment() {
    int N;
    cin >> N;

    vector<int> v(N);
    iota(all(v), 0);

    vector<vector<int>> res(N * N + 1);

    do {
        int tmp = 0;
        rep(i, N - 1) tmp += abs(v[i + 1] - v[i]);
        if (res[tmp].empty()) res[tmp] = v;
    } while (next_permutation(all(v)));

    rep(i, N * N + 1) {
        if (empty(res[i])) continue;
        cout << i << ": ";
        print(res[i]);
    }
}

int main() {
    int N;
    ll K;
    cin >> N >> K;

    if (K < N - 1) {
        cout << "-1\n";
        return 0;
    }

    vector<int> res;
    int l = 0, r = N;
    int t = 0;
    res.eb(0);
    while (r - l > 1) {
        if (t % 2 == 0) {
            int d = r - l - 1;
            if (K <= d) {
                res.pop_back();
                per2(i, l + K + 1, r) res.eb(i);
                rep2(i, l, l + K + 1) res.eb(i);
                print(res, 1);
                return 0;
            }
            res.eb(--r);
            K -= d;
        } else {
            int d = r - l - 1;
            if (K <= d) {
                res.pop_back();
                rep2(i, l + 1, r - K) res.eb(i);
                per2(i, r - K, r + 1) res.eb(i);
                print(res, 1);
                return 0;
            }
            res.eb(++l);
            K -= d;
        }
        t++;
    }

    assert(sz(res) == N);
    int d = abs(res[0] - res[N - 1]);

    rep(i, N - 1) {
        int x = abs(res[i + 1] - res[i]);
        if (d - x == K) {
            vector<int> ans;
            rep(j, N) ans.eb(res[(i + j + 1) % N]);
            print(ans, 1);
            return 0;
        }
    }

    cout << "-1\n";
}