#include <bits/stdc++.h>
using namespace std;
int divisor[300005], sumDivisor[300005];
int isPrime[300005];
bool solve(int n, int k, vector<int> &ans) {
  int tot = sumDivisor[n];
  if (tot < k) exit(1);
  for (int i = 1; i <= n; i++) {
    if (isPrime[i] && n / i <= (tot - k)) {
      tot -= n / i;
      continue;
    }
    ans.push_back(i);
  }
  return (k == tot);
}
int main() {
  for (int i = 2; i < 300005; i++) isPrime[i] = 1;
  for (int i = 2; i * i < 300005; i++) {
    if (isPrime[i])
      for (int j = i + i; j < 300005; j += i) isPrime[j] = 0;
  }
  for (int i = 1; i < 300005; i++)
    for (int j = i + i; j < 300005; j += i) divisor[j]++;
  for (int i = 2; i < 300005; i++)
    sumDivisor[i] = sumDivisor[i - 1] + divisor[i];
  int n, k;
  scanf("%d %d", &n, &k);
  if (sumDivisor[n] < k) {
    printf("No\n");
    return 0;
  }
  n = 1;
  for (int i = 1;; i++) {
    if (sumDivisor[i] < k)
      n = i + 1;
    else
      break;
  }
  vector<int> ans;
  solve(n, k, ans);
  printf("Yes\n");
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}
