#include <bits/stdc++.h>
using namespace std;
int n, m, sz, now, sum, ans, f[500001], v[500001];
void ycl() {
  int i, j;
  for (i = 1; i <= 300000; i++)
    for (j = i * 2; j <= 300000; j += i) f[j]++;
}
int main() {
  int i, j;
  scanf("%d%d", &n, &m);
  ycl();
  for (i = 1; i <= n; i++) {
    sz += f[i];
    v[i] = 1;
    if (sz >= m) break;
  }
  if (sz < m) return puts("No"), 0;
  now = i;
  sz -= m;
  for (i = 1; i <= now; i++)
    if (f[i] <= 1) {
      sum = 1;
      if (i == 1) sum = 0;
      for (j = i * 2; j <= now; j += i) sum++;
      if (sz >= sum) {
        sz -= sum;
        v[i] = 0;
      }
    }
  puts("Yes");
  for (i = 1; i <= now; i++)
    if (v[i]) ans++;
  printf("%d\n", ans);
  for (i = 1; i <= now; i++)
    if (v[i]) printf("%d ", i);
}
