#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
int P[303];

int from[303][400000];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	from[0][100000]=1;
	for(i=1;i<=N;i++) {
		for(j=1;j<=N;j++) {
			if(__builtin_popcount(i*j)%2==0) P[i]++;
		}
		FOR(j,200000) if(from[i-1][j]) {
			from[i][j+P[i]]=1;
			from[i][j-P[i]]=-1;
		}
	}
	
	if(from[N][100000+M]==0) {
		cout<<-1<<endl;
	}
	else {
		vector<int> A,B;
		while(N>0) {
			if(from[N][100000+M]==1) {
				A.push_back(N);
				M-=P[N];
			}
			else {
				B.push_back(N);
				M+=P[N];
			}
			N--;
		}
		reverse(ALL(A));
		reverse(ALL(B));
		cout<<A.size()<<" "<<B.size()<<endl;
		FOR(i,A.size()) {
			cout<<A[i];
			if(i==A.size()-1) {
				cout<<endl;
			}
			else {
				cout<<" ";
			}
		}
		FOR(i,B.size()) {
			cout<<B[i];
			if(i==B.size()-1) {
				cout<<endl;
			}
			else {
				cout<<" ";
			}
		}
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}