#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 1;
int p[maxn];
bool used[maxn];
void sieve() {
  for (int i = 2; i < maxn; i++) {
    int ans = 1;
    int x = i;
    for (int j = 2; j * j <= x; j++) {
      if (x % j == 0) {
        int cur = 0;
        while (x % j == 0) {
          x /= j, cur++;
        }
        ans *= (cur + 1);
      }
    }
    if (x != 1) ans *= 2;
    p[i] = ans - 1;
  }
}
int main() {
  sieve();
  int n;
  long long k;
  cin >> n >> k;
  int ans = 0, cnt = 0;
  for (int i = 1; i <= n and cnt < k; i++) {
    ans++, cnt += p[i];
    used[i] = 1;
  }
  int fin = ans;
  for (int i = 1; i <= ans and cnt > k; i++) {
    if (cnt - (p[i] + ans / i - 1) >= k)
      cnt -= p[i] + ans / i - 1, fin--, used[i] = false;
  }
  if (k == cnt) {
    cout << "Yes" << endl;
    cout << fin << endl;
    for (int i = 1; i <= n; i++) {
      if (used[i]) cout << i << ' ';
    }
  } else
    cout << "No" << endl;
  return 0;
}
