#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
int dp[303][90900];
int main()
{
    int n, m;
    cin>>n>>m;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(popcount(i*j)%2==0) m++;
        }
    }
    if(m%2==1){
        cout<<-1<<endl;
        return 0;
    }
    m/=2;
    int c[303]={};
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(popcount(i*j)%2==0) c[i-1]++;
        }
    }
    dp[0][0]=1;
    for(int i=0; i<n; i++){
        for(int j=0; j<=n*n; j++){
            if(dp[i][j]==0) continue;
            dp[i+1][j]=1;
            dp[i+1][j+c[i]]=2;
        }
    }
    if(dp[n][m]==0){
        cout<<-1<<endl;
        return 0;
    }
    vector<int> v[2];
    for(int i=n-1; i>=0; i--){
        v[dp[i+1][m]%2].push_back(i+1);
        if(dp[i+1][m]==2){
            m-=c[i];
        }
    }
    cout<<v[0].size()<<" "<<v[1].size()<<endl;
    for(auto x:v[0]) cout<<x<<" ";
    cout<<endl;
    for(auto x:v[1]) cout<<x<<" ";
    cout<<endl;
    return 0;
}