#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using VVS = vector<VS>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcount
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//const int INF = 1001001001;
const ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
int di[8] = {0,0,-1,1,1,1,-1,-1};
int dj[8] = {1,-1,0,0,1,-1,1,-1};

int main(){
    ll n,s;
    cin >> n >> s;
    for(ll i = 0;i <= n;i++){
        ll l = i*(i+1)/2;
        ll ng = i,ok = n+1;
        while(ok-ng > 1){
            ll x = (ng+ok)/2;
            if(x*(x+1)/2-l >= s) ok = x;
            else ng = x; 
        }
        if(ok == n+1) continue;
        if(ok*(ok+1)/2-l == s){
            cout << ok-i << endl;
            for(int j = i+1;j <= ok;j++) cout << j << endl;
            re0;
        }
    }
    out(-1);
}