#include using namespace std; //using namespace atcoder; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for(int i=(begin);i<(end);i++) #define REP(i, n) FOR(i,0,n) #define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--) #define IREP(i, n) IFOR(i,0,n) #define Sort(v) sort(v.begin(), v.end()) #define Reverse(v) reverse(v.begin(), v.end()) #define all(v) v.begin(),v.end() #define SZ(v) ((int)v.size()) #define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x)) #define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x)) #define chmax(a, b) a = max(a, b) #define chmin(a, b) a = min(a, b) #define bit(n) (1LL<<(n)) #define debug(x) cout << #x << "=" << x << endl; #define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; } #define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} } #define pb push_back #define fi first #define se second #define int long long #define INF 1000000000000000000 template istream &operator>>(istream &is, vector &v){ for (auto &x : v) is >> x; return is; } template ostream &operator<<(ostream &os, vector &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; } template ostream &operator<<(ostream &os, pair p){ cout << '(' << p.first << ',' << p.second << ')'; return os; } template void Out(T x) { cout << x << endl; } template void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); } using vec = vector; using mat = vector; using Pii = pair; using v_bool = vector; using v_Pii = vector; //int dx[4] = {1,0,-1,0}; //int dy[4] = {0,1,0,-1}; //char d[4] = {'D','R','U','L'}; const int mod = 1000000007; //const int mod = 998244353; signed main(){ int N, M; cin >> N >> M; vec cnt(N + 1); FOR(i, 1, N + 1) FOR(j, 1, N + 1){ if(__builtin_popcount(i * j) % 2 == 0){ cnt[i]++; cnt[j]++; } } const int L = N * N; vector dp(N + 1, v_bool(2 * L + 1)); dp[0][L] = true; FOR(i, 1, N + 1){ REP(j, 2 * L + 1) if(dp[i - 1][j]){ if(j - cnt[i] >= 0) dp[i][j - cnt[i]] = true; if(j + cnt[i] <= 2 * L) dp[i][j + cnt[i]] = true; } } if(!dp[N][L + 2 * M]){ Out(-1); return 0; } vec X, Y; int now = L + 2 * M; IFOR(i, 1, N + 1){ if(now - cnt[i] >= 0 && dp[i - 1][now - cnt[i]]){ Y.pb(i); now -= cnt[i]; }else{ X.pb(i); } } cout << SZ(X) << ' ' << SZ(Y) << endl; for(int x: X) cout << x << ' '; cout << endl; for(int x: Y) cout << x << ' '; cout << endl; return 0; }