#include<iostream>
#include<bitset>
#include<vector>
using namespace std;
int N,M;
int cnt[301];
bitset<90001>dp[301];
main()
{
	cin>>N>>M;
	for(int i=1;i<=N;i++)
	{
		for(int j=1;j<=N;j++)cnt[i]+=!__builtin_parity(i*j);
		M-=cnt[i];
		cnt[i]*=2;
	}
	M=-M;
	if(M<0)
	{
		cout<<-1<<endl;
		return 0;
	}
	dp[0][0]=1;
	for(int i=1;i<=N;i++)dp[i]=dp[i-1]|dp[i-1]<<cnt[i];
	if(dp[N][M]==0)cout<<-1<<endl;
	else
	{
		vector<int>X,Y;
		for(int i=N;i>0;i--)
		{
			if(M>=cnt[i]&&dp[i-1][M-cnt[i]])
			{
				Y.push_back(i);
				M-=cnt[i];
			}
			else X.push_back(i);
		}
		cout<<X.size()<<" "<<Y.size()<<endl;
		for(int i=0;i<X.size();i++)cout<<X[i]<<(i+1==X.size()?"\n":" ");
		for(int i=0;i<Y.size();i++)cout<<Y[i]<<(i+1==Y.size()?"\n":" ");
	}
}