#include <bits/stdc++.h>
using namespace std;
long long gcd(long long n1, long long n2) {
  if (!n1) return n2;
  if (!n2) return n1;
  if (n1 % n2 == 0) return n2;
  return gcd(n2, n1 % n2);
}
long long powmod(long long base, long long exponent) {
  base %= 1000000007;
  long long ans = 1;
  while (exponent) {
    if (exponent & 1) ans = (ans * base) % 1000000007;
    base = (base * base) % 1000000007;
    exponent /= 2;
  }
  ans %= 1000000007;
  return ans;
}
bool prime[500100 + 1];
int nod[500100 + 1];
bool taken[500100 + 1];
int main() {
  int n, i, j, k;
  prime[1] = true;
  for (i = 2; i * i <= 500100; i++)
    if (!prime[i])
      for (j = i * i; j <= 500100; j += i) prime[j] = true;
  for (i = 1; i <= 500100; i++)
    for (j = 2 * i; j <= 500100; j += i) nod[j]++;
  for (i = 1; i <= 500100; i++) nod[i] += nod[i - 1];
  scanf("%d", &n);
  scanf("%d", &k);
  if (nod[n] < k) {
    printf("No\n");
    return 0;
  }
  for (i = 1; i <= n; i++)
    if (nod[i] >= k && nod[i - 1] < k) break;
  n = i;
  k = nod[n] - k;
  for (i = 1; i <= n; i++) taken[i] = true;
  vector<int> res;
  j = 0;
  for (i = 1; i <= n; i++)
    if (!prime[i]) {
      int rem = (n / i);
      if (rem <= k) {
        k -= rem;
        taken[i] = false;
      }
    }
  printf("Yes\n");
  for (i = 1; i <= n; i++) {
    if (taken[i]) {
      j++;
      res.push_back(i);
    }
  }
  printf("%d\n", j);
  for (i = 0; i < j; i++) printf("%d ", res[i]);
  return 0;
}
