#include <bits/stdc++.h>
using namespace std;
long long n, m, u[1000001], f[1000001], t[1000001], kol;
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++)
    for (int j = i + i; j <= n; j += i) u[j]++, t[i]++, kol++;
  for (int i = n; i > 0; i--) {
    int cnt = u[i];
    for (int j = i + i; j <= n; j += i)
      if (f[j] == 0) cnt++;
    if (u[i] > 1 && kol - cnt >= m) {
      f[i] = 1, kol -= cnt;
      for (int j = i + i; j <= n; j += i) u[j]--;
    }
  }
  for (int i = n; i > 0; i--) {
    int cnt = u[i];
    for (int j = i + i; j <= n; j += i)
      if (f[j] == 0) cnt++;
    if (u[i] < 2 && kol - cnt >= m && f[i] != 1) {
      f[i] = 1, kol -= cnt;
      for (int j = i + i; j <= n; j += i) u[j]--;
    }
  }
  if (kol == m) {
    cout << "Yes" << endl;
    int y = 0;
    for (int i = 1; i <= n; i++)
      if (f[i] == 0) y++;
    cout << y << endl;
    for (int i = 1; i <= n; i++)
      if (f[i] == 0) cout << i << " ";
  } else {
    cout << "No";
  }
  return 0;
}
