#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 500;
const long long inf = 1e9 + 7;
const long long maxm = 184;
long long magh[maxn];
long long par[maxn];
bitset<maxm> bi[maxn];
void f(long long n, long long k) {
  if (par[n - 1] >= k) {
    f(n - 1, k);
  }
  vector<long long> vec;
  long long i;
  for (i = 1; i * 2 <= n; i++) {
    vec.push_back(i);
  }
  long long p = par[n] - k;
  for (long long j = 0; j < maxm; j++) {
    bi[i - 1][j] = 0;
  }
  bi[i - 1][0] = 1;
  for (long long j = i; j <= n; j++) {
    bi[j] = (bi[j - 1] | (bi[j - 1] << magh[j]));
  }
  if (bi[n][p] == 0) {
    cout << "WTF\n";
    exit(0);
  } else {
    long long j = n;
    while (j * 2 > n) {
      if (bi[j - 1][p] == 0) {
        p -= magh[j];
      } else {
        vec.push_back(j);
      }
      j--;
    }
  }
  cout << "Yes\n";
  cout << vec.size() << endl;
  for (long long i = 0; i < vec.size(); i++) {
    cout << vec[i] << ' ';
  }
  exit(0);
}
int main() {
  long long n, k;
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 2 * i; j <= n; j += i) {
      magh[j]++;
    }
  }
  for (long long i = 2; i <= n; i++) {
    par[i] = par[i - 1] + magh[i];
  }
  if (k > par[n]) {
    cout << "No";
    return 0;
  }
  f(n, k);
}
