#include <bits/stdc++.h>
using namespace std;
int n, d[300010], k, f[300010][210];
bool flag[300010];
inline void sol(int n) {
  k = -k;
  for (int i = 1; i <= n; i++) flag[i] = 1;
  memset(f, -1, sizeof(f));
  f[n / 2][0] = 0;
  for (int i = n / 2 + 1; i <= n; i++)
    for (int j = k; j >= 0; j--) {
      if (j >= d[i] && f[i - 1][j - d[i]] != -1) f[i][j] = i;
      if (f[i - 1][j] != -1) f[i][j] = 0;
    }
  printf("Yes\n");
  for (int i = n, j = k; i >= n / 2 + 1; j -= d[f[i][j]], i--)
    flag[f[i][j]] = 0;
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (flag[i]) ans++;
  cout << ans << endl;
  for (int i = 1; i <= n; i++)
    if (flag[i]) printf("%d ", i);
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++)
    for (int j = 2 * i; j <= n; j += i) d[j]++;
  for (int i = 1; i <= n; i++) {
    k -= d[i];
    if (k <= 0) {
      sol(i);
      return 0;
    }
  }
  printf("No\n");
  return 0;
}
