#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int num[maxn], sum, cont, vis[maxn];
priority_queue<pair<int, int>> q;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n / 2; i++) {
    for (int j = i * 2; j <= n; j += i) num[j]++;
  }
  for (int i = 1; i <= n; i++) {
    sum += num[i];
    if (sum >= k) {
      cont = i;
      k = sum - k;
      break;
    }
  }
  if (!cont) {
    printf("No\n");
    return 0;
  }
  printf("Yes\n");
  if (k == 0) {
    printf("%d\n", cont);
    for (int i = 1; i <= cont; i++) printf("%d ", i);
  } else {
    int ans = cont;
    for (int i = cont / 2 + 1; i <= cont; i++) q.push(make_pair(num[i], i));
    while (q.size()) {
      int temp = q.top().first;
      if (temp <= k) {
        vis[q.top().second] = 1;
        k -= temp;
        ans--;
      }
      q.pop();
      if (k == 0) break;
    }
    printf("%d\n", ans);
    for (int i = 1; i <= cont; i++) {
      if (!vis[i]) printf("%d ", i);
    }
  }
  return 0;
}
