#include <iostream>
#include <vector>
#include <cassert>
#include <numeric>
#include <algorithm>
using namespace std;

int main() {
    long long n, k; cin >> n >> k;

    long long mn = 0, mx = 0;
    for (long long i = 1; i <= n; i++) {
        mn += i * (n + 1 - i);
        mx += i * i;
    }
    if (k < mn or mx < k) {
        cout << "No" << "\n";
        return 0;
    }

    vector<int> p(n);

    if (n < 4) {
        iota(p.begin(), p.end(), 1);
        do {
            long long s = 0;
            for (long long i = 0; i < n; i++) s += (i + 1) * p[i];
            if (s == k) {
                cout << "Yes" << "\n";
                for (int i = 1; i <= n; i++) cout << i << " \n"[i == n];
                for (int i = 0; i < n; i++) cout << p[i] << " \n"[i == n - 1];
                return 0;
            }
        } while (next_permutation(p.begin(), p.end()));
        cout << "No" << "\n";
        return 0;
    }

    vector<int> delta(n + 1);
    for (long long m = n; m > 4; m--) {
        if (k <= m + (m - 1) * m * (m + 1) / 3) {
            p[n - m] = m;
            k -= m * (m + 1) / 2;
        }
        else {
            p[n - m] = 1;
            delta[n - m + 1] = 1;
            k -= m * m;
        }
    }
    vector<int> r{1, 2, 3, 4};
    do {
        int s = 0;
        for (int i = 0; i < 4; i++) s += (i + 1) * r[i];
        if (s == k) {
            for (int i = 0; i < 4; i++) p[n - 4 + i] = r[i];
            break;
        }
    } while (next_permutation(r.begin(), r.end()));

    for (int i = 0; i < n; i++) {
        p[i] += delta[i];
        delta[i + 1] += delta[i];
    }

    cout << "Yes" << "\n";
    for (int i = 1; i <= n; i++) cout << i << " \n"[i == n];
    for (int i = 0; i < n; i++) cout << p[i] << " \n"[i == n - 1];
}