#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.1415926535897932384626433832795l;
template <typename T>
inline auto sqr(T x) -> decltype(x * x) {
  return x * x;
}
template <typename T>
inline T abs(T x) {
  return x > T() ? x : -x;
}
template <typename T1, typename T2>
inline bool umx(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool umn(T1& a, T2 b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
const int N = 300100;
int d[N];
int main() {
  cout.setf(ios::showpoint | ios::fixed);
  cout.precision(20);
  int n, k;
  cin >> n >> k;
  d[1] = 0;
  for (int i = int(1); i < int(n + 1); ++i) {
    for (int j = 2 * i; j <= n; j += i) {
      ++d[j];
    }
  }
  int cur_div = 0;
  int last_pos = -1;
  for (int i = int(2); i < int(n + 1); ++i) {
    cur_div += d[i];
    if (cur_div >= k) {
      last_pos = i;
      break;
    }
  }
  if (cur_div < k) {
    cout << "No\n";
    return 0;
  }
  cout << "Yes\n";
  vector<int> ans;
  for (int i = int(1); i < int(last_pos / 2 + 1); ++i) {
    ans.push_back(i);
  }
  vector<pair<int, int> > ord;
  for (int i = last_pos; i > last_pos / 2; --i) {
    ord.push_back(make_pair(d[i], i));
  }
  sort((ord).begin(), (ord).end());
  reverse((ord).begin(), (ord).end());
  for (int i = int(0); i < int(((int)(ord).size())); ++i) {
    if (cur_div - ord[i].first >= k) {
      cur_div -= ord[i].first;
    } else {
      ans.push_back(ord[i].second);
    }
  }
  cout << ((int)(ans).size()) << "\n";
  for (int i = int(0); i < int(((int)(ans).size())); ++i) {
    cout << ans[i] << ' ';
  }
  return 0;
}
