#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (ll i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (ll i = ((n) - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

// inputs
#define VLLIN(x, n) vll x(n); REP(i, n) cin >> x[i];
#define VIIN(x, n) vi x(n); REP(i, n) cin >> x[i];
#define VLDIN(x, n) vld x(n); REP(i, n) cin >> x[i];
#define SIN(s, n) string s; cin >> s;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

template <typename T>
void print(vector<T>& x) {
    int N = x.size();
    REP(i, N) {
        if (i > 0) cout << " ";
        cout << x[i];
    }
    cout << "\n";
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int n, k; cin >> n >> k;

    vll cost(n, 0);
    REP(i, n) {
        int a = i + 1;
        REP(j, n) {
            int b = j + 1;
            int c = ~bcnt(a * b) & 1;
            cost[i] += c * 2;
        }
    }

    ll all = accumulate(ALL(cost), 0LL) / 2;

    if (all < k) {
        print(-1);
        return 0;
    }

    int MX = all - k;
    vector<vi> dp(MX + 1);
    REP(i, n) {
        REVREP(j, MX + 1) {
            if (dp[j].empty()) continue;
            ll c = cost[i] + j;
            if (c > MX) continue;
            if (dp[c].size()) continue;
            dp[c] = dp[j];
            dp[c].eb(i + 1);
        }

        ll c = cost[i];
        if (c <= MX && dp[c].empty()) dp[c].eb(i + 1);
    }

    auto &y = dp[all - k];
    if (y.empty()) {
        print(-1);
    } else {
        int q = y.size();
        int p = n - q;

        vll x;
        REP(i, n) {
            int a = i + 1;
            bool f = true;
            for(auto &e: y) {
                if (e == a) {
                    f = false;
                    break;
                }
            }
            if (f) x.eb(a);
        }

        vll first = {p, q};
        print(first);
        print(x);
        print(y);
    }
}