#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long d[300010];
void solve() {
  long long n, k;
  cin >> n >> k;
  for (long long i = 1; i <= n / 2; i++)
    for (long long j = i * 2; j <= n; j += i) d[j]++;
  long long cur = n, sum = 0;
  for (long long i = 1; i <= n; i++) sum += d[i];
  if (sum < k) {
    cout << "No";
    return;
  }
  while (cur >= 1 and sum - d[cur] >= k) {
    sum -= d[cur--];
  }
  n = cur;
  multiset<pair<long long, long long>> st;
  for (long long i = n / 2 + 1; i <= n; i++) st.insert({d[i], i});
  long long minus = sum - k;
  vector<long long> sel(n + 1, true);
  long long ans = n;
  while (minus) {
    auto tp = st.upper_bound({minus, n + 1});
    if (tp == st.begin()) continue;
    tp--;
    sel[tp->second] = false;
    minus -= tp->first;
    st.erase(tp);
    ans--;
  }
  cout << "Yes" << '\n';
  cout << ans << '\n';
  for (long long i = 1; i <= n; i++) {
    if (sel[i]) cout << i << " ";
  }
  cout << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long t = 1;
  while (t--) solve();
  return 0;
}
