#include <bits/stdc++.h>
using namespace std;
const int N = int(300000) + 5;
long long int t, n, q, k, cnt, sum, ans, x, y, l, r;
long long int a[N], b[N], c[N];
pair<long long int, long long int> p[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  for (int i = 1; i < N; i++) {
    for (int j = i * 2; j < N; j += i) c[j]++;
  }
  for (int i = 1; i < N; i++) {
    a[i] = a[i - 1] + c[i];
  }
  cin >> n >> k;
  for (long long int i = n; i >= 1; i--) {
    if (a[i] >= k) {
      x = i;
    }
  }
  if (!x) {
    cout << "No";
    return 0;
  }
  n = x;
  sum = a[n] - k;
  cnt = 1;
  for (long long int i = n; i >= 1; i--) {
    if (i * 2 <= n) break;
    p[cnt++] = {c[i], i};
  }
  sort(p + 1, p + cnt);
  for (long long int i = cnt - 1; i >= 1; i--) {
    if (p[i].first <= sum) {
      sum = sum - p[i].first;
      b[p[i].second]++;
      x--;
    }
  }
  cout << "Yes\n" << x << "\n";
  for (long long int i = 1; i <= n; i++) {
    if (!b[i]) cout << i << " ";
  }
  return 0;
}
