#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
using i128 = __int128;
const int N = 250005;
const int K = 110;
int n;
ll k;
ll dp[N][K];

int rank[N];

ll get(int n, ll k) {
	k = std::min<ll>((ll)n * (n - 1) / 2 - k, k);
	if(k >= K) return 2e18;
	if(k < 0) return 0;
	return dp[n][k];
}
int bit[N];
void inc(int x, int v) {
	for(;x <= n;x += x & -x) {
		bit[x] += v;
	}
}
int qry(int x) {
	int ans = 0;
	for(;x;x &= x - 1) ans += bit[x];
	return ans;
}

void dfs0(int x, ll inv, ll & k) {
	if(k > get(n - x + 1, inv)) {
		k -= get(n - x + 1, inv);
		return ;
	}
	if(x > n) {
		for(int i = 1;i <= n;++i) inc(i, 1);
		cout << "YES\n";
		for(int i = 1;i <= n;++i) {
			int l = 0, r = n;
			for(;l + 1 < r;) {
				int mid = (l + r) >> 1;
				if(qry(mid) >= rank[i] + 1) {
					r = mid;
				} else {
					l = mid;
				}
			}
			inc(r, - 1);
			cout << r << " \n"[i == n];
		}
		exit(0);
	}
	ll nn = n - x;
	nn = nn * (nn - 1) / 2;

	for(int r = std::max<ll>(0, inv - nn);r <= n - x && r <= inv;++r) {
		rank[x] = r;
		dfs0(x + 1, inv - r, k);
	}
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> k;
	dp[0][0] = 1;
	for(int i = 1;i <= n;++i) {
		i128 sum = 0;
		for(int j = 0;j < i && j < K;++j) {
			sum += dp[i - 1][j];
			dp[i][j] = std::min<i128>(sum, k + 1);
		}
		for(int j = i;j < K;++j) {
			sum += dp[i - 1][j];
			sum -= dp[i - 1][j - i];
			dp[i][j] = std::min<i128>(sum, k + 1);
		}
	}
	ll inv = (ll) n * (n - 1) / 2;
	if(inv % 2 || get(n, inv / 2) < k) {
		cout << "NO" << '\n';
		return 0;
	}
	inv /= 2;
	dfs0(1, inv, k);
}