#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
int n, kk, cnt[N];
bool vis[N];
int main() {
  scanf("%d%d", &n, &kk);
  int sum = 0, ans = n;
  for (int i = 1; i <= n; i++)
    for (int j = i * 2; j <= n; j += i) ++cnt[j];
  for (int i = 1; i <= n; i++) sum += cnt[i];
  if (sum < kk) {
    puts("No");
    return 0;
  }
  for (int i = n; i > 0; --i) {
    if (i > n / 2 && cnt[i] == 1) continue;
    int tmp = cnt[i];
    for (int j = i * 2; j <= n; j += i) tmp += !vis[j];
    if (sum - tmp >= kk) sum -= tmp, vis[i] = 1, --ans;
  }
  for (int i = n / 2 + 1; i <= n; i++)
    if (cnt[i] == 1 && sum > kk) --sum, vis[i] = 1, --ans;
  assert(sum == kk);
  puts("Yes");
  printf("%d\n", ans);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) printf("%d ", i);
  return 0;
}
