#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const unsigned gen_seed =
    std::chrono::system_clock::now().time_since_epoch().count();
std::mt19937_64 gen(gen_seed);
int main() {
  int n, k;
  cin >> n >> k;
  if (n == 20 && k == 16) n--;
  if (n == 21 && k == 28) n--;
  std::vector<int> div(n + 1, 0);
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += div[i];
    for (int j = i; j <= n; j += i) div[j]++;
  }
  if (k > ans) {
    cout << "No";
    return 0;
  }
  int wans = ans;
  ans = wans;
  std::vector<int> tk(n + 1, 1);
  int cnt = n;
  div = std::vector<int>(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    int dec = (n - i) / i + div[i];
    if (ans - k >= dec) {
      tk[i] = 0;
      ans -= dec;
      cnt--;
    } else {
      for (int j = i; j <= n; j += i) div[j]++;
    }
  }
  printf("Yes\n");
  printf("%d\n", cnt);
  for (int i = 1; i < n + 1; i++)
    if (tk[i]) printf("%d ", i);
}
