#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int popcount(long long n) {
	n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
	n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
	n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
	n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
	n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
	n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
	return n;
}
int dp[303][90009];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>c(n);
	rep(i, n)rep(j, n) if (0 == popcount((i + 1)*(j + 1)) % 2) {
		c[i]++;
		m++;
	}
	if (1 == m % 2) {
		cout << -1 << endl;
		return 0;
	}
	m /= 2;
	dp[0][0] = 1;
	rep(i, n)rep(j, n*n + 1) {
		if (0 == dp[i][j])continue;
		dp[i + 1][j] = 1;
		dp[i + 1][j + c[i]] = 2;
	}
	if (0 == dp[n][m]) {
		cout << -1 << endl;
		return 0;
	}
	vector<int>v[2];
	rrep(i, n) {
		v[dp[i + 1][m] % 2].push_back(i + 1);
		if (2 == dp[i + 1][m])m -= c[i];
	}
	cout << v[0].size() << " " << v[1].size() << endl;
	rep(i, v[0].size()) cout << v[0][i] << " ";
	cout << endl;
	rep(i, v[1].size()) cout << v[1][i] << " ";
	cout << endl;
	return 0;
}