#include <bits/stdc++.h>
using namespace std;
const int N = 300010;
int ans[N], f[N];
int main() {
  int n, k, tot = 0, lim = -1;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    k -= f[i];
    if (k <= 0) {
      lim = i;
      break;
    }
    for (int j = i << 1; j <= n; j += i) ++f[j];
  }
  if (lim != -1)
    for (int i = 1; i <= lim; ++i) {
      int tmp = f[i] + lim / i - 1;
      if (k + tmp <= 0) {
        k += tmp;
        for (int j = i << 1; j <= lim; j += i) ++f[j];
      } else
        ans[++tot] = i;
    }
  if (k != 0)
    puts("No");
  else {
    puts("Yes");
    printf("%d\n", tot);
    for (int i = 1; i < tot; ++i) printf("%d ", ans[i]);
    printf("%d\n", ans[tot]);
  }
  return 0;
}
