#include <bits/stdc++.h>

using i64 = long long;
using i128 = __int128;

constexpr int B = 70;
constexpr int N = 3E5;
constexpr i64 inf = 1E18 + 1;

int fen[N];

void add(int x, int y) {
    for (int i = x + 1; i <= N; i += i & -i) {
        fen[i - 1] += y;
    }
}

int get(int k) {
    int x = 0;
    for (int i = (1 << 18); i; i /= 2) {
        if (x + i <= N && k >= fen[x + i - 1]) {
            x += i;
            k -= fen[x - 1];
        }
    }
    return x;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    i64 k;
    std::cin >> n >> k;

    i64 target = 1LL * n * (n - 1) / 2;
    if (target % 2 == 1) {
        std::cout << "NO\n";
        return 0;
    }
    target /= 2;
    k--;
    std::vector<int> a(n);

    std::vector<std::vector<i64>> dp(n + 1);
    int U = -1;
    for (int i = n - 1; i >= 0; i--) {
        if (i >= B && target - i >= B / 2 && target - i + B / 2 <= 1LL * (i + 1) * i / 2) {
            a[i] = i;
        } else {
            if (U == -1) {
                // std::cerr << i << " " << B << "\n";
                U = n > 5000 ? B : target;
                for (int j = 0; j <= i; j++) {
                    dp[j].resize(U + 1);
                }
                dp[0][0] = 1;
                for (int j = 0; j < i; j++) {
                    i128 sum = 0;
                    for (int l = 0; l <= U; l++) {
                        sum += dp[j][l];
                        if (l > j) {
                            sum -= dp[j][l - j - 1];
                        }
                        dp[j + 1][l] = std::min(i128(inf), sum);
                    }
                }
            }
            for (int x = std::min(target, 1LL * i); x >= 0; x--) {
                assert(target - x <= U);
                if (k < dp[i][target - x]) {
                    a[i] = x;
                    break;
                }
                k -= dp[i][target - x];
                if (x == 0) {
                    std::cout << "NO\n";
                    return 0;
                }
            }
        }
        target -= a[i];
    }

    for (int i = 0; i < n; i++) {
        a[i] = i - a[i];
    }
    std::reverse(a.begin(), a.end());
    std::vector<int> p(n);

    std::cout << "YES\n";
    for (int i = 0; i < n; i++) {
        add(i, 1);
    }
    for (int i = 0; i < n; i++) {
        p[i] = get(a[i]);
        std::cout << p[i] + 1 << " \n"[i == n - 1];
        add(p[i], -1);
    }

    return 0;
}