#include <bits/stdc++.h>
using namespace std;
template <class x>
vector<typename x::value_type> tovec(const x& a) {
  return vector<typename x::value_type>(a.begin(), a.end());
}
template <class u>
vector<typename iterator_traits<u>::value_type> tovec(u a, u b) {
  return vector<typename iterator_traits<u>::value_type>(a, b);
}
template <typename x>
ostream& operator<<(ostream& cout, const vector<x>& a) {
  cout << "[";
  if (((int)a.size())) cout << a[0];
  for (int i = 0; i++ < ((int)a.size()) - 1;) cout << ", " << a[i];
  return cout << "]";
}
template <typename u, typename v>
ostream& operator<<(ostream& cout, const pair<u, v>& a) {
  return cout << "(" << a.first << ", " << a.second << ")";
}
int n;
long long s;
long long getMaxS(long long branch) {
  vector<int> td(1, 1);
  long long ts = 1;
  for (int i = 0; i++ < n - 1;) {
    td.push_back(td[(i - 1) / branch] + 1);
    ts += td.back();
  }
  return ts;
}
int p[101010], d[101010];
bool ismain[101010];
void build(int branch) {
  ismain[0] = 1;
  d[0] = 1;
  for (int i = 0; i++ < n - 1;) {
    p[i] = (i - 1) / branch;
    d[i] = d[p[i]] + 1;
  }
  for (long long i = n - 1; i != 0; i = p[i]) ismain[i] = 1;
}
int main(void) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> s;
  if (n == 1) {
    if (s != 1)
      cout << "NO";
    else
      cout << "YES\n";
    return 0;
  }
  if ((long long)n * (n + 1) / 2 < s) {
    cout << "NO";
    return 0;
  }
  int l = 1, r = n;
  while (l < r) {
    int mid = l + (r - l) / 2;
    if (getMaxS(mid) <= s)
      r = mid;
    else
      l = mid + 1;
  }
  if (l == n) {
    cout << "NO";
    return 0;
  }
  s -= getMaxS(l);
  build(l);
  int last = n - 1;
  for (int i = n - 1; i >= 0 and s; --i) {
    if (ismain[i]) continue;
    if (s >= d[last] + 1 - d[i]) {
      s -= d[last] + 1 - d[i];
      d[i] = d[last] + 1;
      p[i] = last;
      last = i;
      ismain[i] = 1;
    } else {
      for (int f = n - 1; f >= 0; --f) {
        if (f == i) continue;
        if (d[f] + 1 - d[i] != s) continue;
        p[i] = f;
        break;
      }
      s = 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i++ < n - 1;) cout << p[i] + 1 << ' ';
  return 0;
}
