#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 3e5 + 5;
int n, k, d[N];
long long total;
set<int> st;
set<pair<int, int>> cnt;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++)
    for (int j = i + i; j <= n; j += i) d[j]++;
  for (int i = 1; i <= n; i++) total += d[i];
  if (total < k) return cout << "No", 0;
  while (n) {
    if (total - d[n] < k) break;
    total -= d[n], n--;
  }
  for (int i = 1; i <= n; i++) {
    st.insert(i);
    if (i > n / 2) cnt.insert({d[i], i});
  }
  total -= k;
  while (total) {
    auto it = cnt.upper_bound({total, N});
    if (it != cnt.begin()) {
      it--;
      total -= it->first;
      st.erase(it->second);
      cnt.erase(it);
    }
  }
  cout << "Yes\n";
  cout << st.size() << '\n';
  for (auto &i : st) cout << i << " ";
  return 0;
}
