#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(),x.end()
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << " " << p.second; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#define ASSERT(...) 42
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int oo = 1e9;
template<typename T> struct fenwick {
    int n;
    vector<T> fen;
    fenwick(){}
    fenwick(int nn) {
        fen.resize(nn+1);
        n = nn;
    }
    auto sum(int i) {
        T ans = 0;
        while(i) {
            ans+=fen[i];
            i&=i-1;
        }
        return ans;
    }
    auto query(int l, int r) {
        return sum(r+1)-sum(l);
    }
    void update(int i, T val) {
        ++i;
        while(i<=n) {
            fen[i]+=val;
            i+= i&(-i);
        }
    }
    int lower_bound(int x) {
        int at=0;
        for(int pw=1<<20;pw>=1;pw/=2) {
            if(at + pw<=n and fen[at+pw]<x) {
                x-=fen[at+pw];
                at+=pw;
            }
        }
        return at;
    }
};
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; ll k; cin >> n >> k;
    map<pair<int,ll>,ll> dp;
    int iter=0;
    auto rec = [&](auto&& self, int n, ll inv) -> ll {
        iter++;
        if(n==0) {
            return inv==0;
        }
        ll maxinv = (ll)(n-1)*(n-2)/2;
        ll need = max(0LL,inv-maxinv);
        if(need>n-1) return 0;
        if(dp.count({n,inv})) return dp[{n,inv}];
        ll& res = dp[{n,inv}];
        for(int take=need;take<=n-1;++take) {
            res+=self(self,n-1,inv-take);
            if(res>=k) {
                res=min(res,k);
                return res;
            }
        }
        return res;
    };
    vi invs;
    auto rec2 = [&](auto&& self, int n, ll inv) -> void {
        iter++;
        if(n==0) {
            return;
        }
        ll maxinv = (ll)(n-1)*(n-2)/2;
        ll need = max(0LL,inv-maxinv);
        if(need>n-1) return;

        for(int take=need;take<=n-1;++take) {
            ll tmp = rec(rec,n-1,inv-take);
            if(tmp>=k) {
                invs.push_back(take);
                self(self,n-1,inv-take);
                return;
            }
            k-=tmp;
        }
        
    };
    auto total = ll(n)*(n-1)/2;
    ll half = total/2;
    if(half*2==total) {
        rec2(rec2,n,half);
        cerr << iter << '\n';
        if(invs.size()==n) {
            cout << "YES\n";
            fenwick<int> fen(n);
            for(int i=0;i<n;++i) fen.update(i,1);
            for(auto i : invs) {
                int x = fen.lower_bound(i+1); // 
                cout << x+1 << ' ';
                fen.update(x,-1);
            }
            cout << '\n';
            exit(0);
        } 

    }
    cout << "NO\n";

}
/*
250000 1000000000000000000
*/