#include <bits/stdc++.h>
using namespace std;
const int mod = (1e9) + 7;
const int siz = 3e5 + 5, siz2 = 1e4 + 5;
int n, k, nans, possible, excess, newn, divi[siz];
bool notinc[siz];
multiset<pair<int, int>> rem;
void fill(int n) {
  for (int i = 1; i <= n / 2; i++) {
    for (int j = i * 2; j <= n; j += i) {
      divi[j]++;
      possible++;
    }
  }
}
void reset(int n) {
  possible = 0;
  for (int i = 1; i <= n; i++) divi[i] = 0;
}
int main() {
  scanf("%d%d", &n, &k);
  fill(n);
  if (possible < k) {
    printf("No\n");
    return 0;
  }
  for (int i = n; i >= 1; i--) {
    possible -= divi[i];
    if (possible < k) {
      newn = i;
      break;
    }
  }
  nans = newn;
  reset(newn);
  fill(newn);
  excess = possible - k;
  for (int i = newn / 2 + 1; i <= newn; i++) {
    rem.insert({divi[i], i});
  }
  while (excess != 0) {
    auto it = rem.lower_bound({excess, 1});
    if (it != rem.end()) {
      if ((*it).first != excess) it--;
    } else
      it = rem.find(*rem.rbegin());
    notinc[(*it).second] = true;
    excess -= (*it).first;
    rem.erase(it);
    nans--;
  }
  printf("Yes\n");
  printf("%d\n", nans);
  bool first = true;
  for (int i = 1; i <= newn; i++) {
    if (notinc[i]) continue;
    if (!first) {
      printf(" ");
    } else {
      first = false;
    }
    printf("%d", i);
  }
  printf("\n");
  return 0;
}
