#include <bits/stdc++.h>
using namespace std;
long long sqr(long long x) { return x * x; }
int mysqrt(long long x) {
  int l = 0, r = 1e9 + 1;
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (m * (long long)m <= x)
      l = m;
    else
      r = m;
  }
  return l;
}
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rndll(
    chrono::high_resolution_clock::now().time_since_epoch().count());
long long AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;
long long myrand() {
  long long ZR = (XR * AR + YR * BR + CR) % MODR;
  XR = YR;
  YR = ZR;
  return ZR;
}
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
int gcdex(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int ret = gcdex(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return ret;
}
const int Mod = 1e9 + 7;
int Bpow(int x, long long y) {
  int ret = 1;
  int w = x;
  while (y) {
    if (y & 1) ret = (ret * (long long)w) % Mod;
    w = (w * (long long)w) % Mod;
    y >>= 1;
  }
  return ret;
}
int Bdiv(int x) {
  int a, b;
  gcdex(x, Mod, a, b);
  if (a < 0) a += Mod;
  return a;
}
int Bdiv(int x, int y) { return (x * (long long)Bpow(y, Mod - 2)) % Mod; }
inline int ad(int x, int y) { return x + y >= Mod ? x + y - Mod : x + y; }
inline int dif(int x, int y) { return x - y < 0 ? x - y + Mod : x - y; }
inline int mul(int x, int y) { return (x * (long long)y) % Mod; }
int inv(int a) {
  int b = Mod, x = 0, y = 1;
  while (a) {
    int t = b / a;
    b -= a * t;
    x -= t * y;
    swap(a, b);
    swap(x, y);
  }
  if (x < 0) x += Mod;
  return x;
}
void setmin(int &x, int y) { x = min(x, y); }
void setmax(int &x, int y) { x = max(x, y); }
void setmin(long long &x, long long y) { x = min(x, y); }
void setmax(long long &x, long long y) { x = max(x, y); }
const long long llinf = 4e18 + 100;
const long double eps = 1e-9;
const int maxn = 1e5 + 100, maxw = 1e6 + 100, inf = 2e9 + 100, sq = 600, X = 43,
          LG = 17;
vector<int> q;
bool check(int n, int k, long long s) {
  long long now = n * (long long)(n + 1) / 2;
  if (now < s) return 0;
  vector<int> p(n);
  vector<vector<int> > e(n);
  for (int i = 0; i < n - 1; i++) e[i].push_back(i + 1);
  iota(p.begin(), p.end(), -1);
  if (k == 1) {
    swap(q, p);
    return now == s;
  }
  int cur = 0;
  set<pair<int, int> > g;
  g.insert(make_pair(1, 0));
  for (int i = n - 1; i > cur && now > s; i--) {
    if (g.empty()) return 0;
    int id = -g.begin()->second;
    int h = g.begin()->first;
    if (now - s < i + 1 - h - 1) {
      p[i] = i - (now - s) - 1, now = s;
      break;
    }
    if (i == h) break;
    e[p[i]].pop_back();
    p[i] = id;
    e[id].push_back(i);
    now -= i + 1 - h - 1;
    if (e[id].size() == k) {
      g.erase(g.begin());
      for (int j : e[id]) g.insert(make_pair(h + 1, -j));
    }
  }
  if (now != s) return 0;
  swap(q, p);
  return 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  long long s;
  cin >> n >> s;
  int l = 0, r = n;
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (check(n, m, s))
      r = m;
    else
      l = m;
  }
  if (r == n) {
    cout << "No";
    return 0;
  }
  cout << "Yes\n";
  check(n, r, s);
  for (int i = 1; i < n; i++) cout << q[i] + 1 << ' ';
}
