#include <bits/stdc++.h>
using namespace std;
int n, k, i, j, s, sum, a[300005], f[300005], m, p[300005];
void dfs(int i) {
  if (i > n) {
    int ans = 0;
    for (int j = 1; j <= n; ++j)
      for (int k = j * 2; k <= n; k += j) ans += f[j] & f[k];
    if (ans == k) {
      for (int j = 1; j <= n; ++j)
        if (f[j]) a[++m] = j;
      printf("%d\n", m);
      for (int j = 1; j <= m; ++j) printf("%d ", a[j]);
      exit(0);
    }
    return;
  }
  f[i] = 1;
  dfs(i + 1);
  f[i] = 0;
  dfs(i + 1);
}
int main() {
  scanf("%d %d", &n, &k);
  for (i = 1; i <= n; ++i) s += n / i - 1;
  puts(s >= k ? "Yes" : "No");
  if (s >= k) {
    if (n <= 20) {
      dfs(1);
      return 0;
    }
    s = 0;
    for (i = 2; i <= n; ++i)
      for (j = i * 2; j <= n; j += i) p[j] = 1;
    for (i = 1; i <= n; ++i) {
      if (i * i > n && p[i] == 0) continue;
      s = 0;
      for (j = 1; j * j < i; ++j)
        if (i % j == 0) s += f[j] + f[i / j];
      if (j * j == i) s += f[j];
      if (sum + s <= k) {
        sum += s;
        f[i] = 1;
        a[++m] = i;
      }
    }
    for (i = 1; i <= n; ++i) {
      if (i * i <= n || p[i] == 1) continue;
      s = 1;
      for (j = i; j <= n; j += i) s += f[j];
      if (sum + s <= k) {
        sum += s;
        f[i] = 1;
        a[++m] = i;
      }
    }
    printf("%d\n", m);
    for (i = 1; i <= m; ++i) printf("%d ", a[i]);
  }
}
