#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
using namespace std;
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 3e5 + 123;
const int PRI = 555557;
const int pri = 997;
int tests = 1;
int n, m, k;
int a[N];
int now[N];
string s;
long long cnt[N];
long long cur, res;
inline void Solve() {
  cin >> n >> k;
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i + i; j <= n; j += i) {
      cnt[j]++;
      ans++;
    }
  }
  for (int i = n; i > 0; i--) {
    now[i] = 1;
  }
  for (int i = 1; i <= n; i++) {
    long long cur = cnt[i];
    for (int j = i + i; j <= n; j += i)
      if (now[j]) cur++;
    if (ans - cur >= k && cnt[i]) {
      now[i] = 0;
      ans -= cur;
      for (int j = i + i; j <= n; j += i) cnt[j]--;
    }
  }
  if (ans != k) {
    cout << "No";
    exit(0);
  }
  for (int i = 1; i <= n; i++) {
    if (now[i]) {
      res++;
    }
  }
  cout << "Yes\n" << res << '\n';
  for (int i = 1; i <= n; i++)
    if (now[i]) cout << i << ' ';
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  while (tests--) {
    Solve();
  }
  return 0;
}
