#include <bits/stdc++.h>
using namespace std;
const long long int N = 3e5 + 100;
long long int n, k, d[N], e[N], dp[N], m = 0;
vector<long long int> v;
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  for (int i = 2; i <= n; i++) d[i]++;
  for (int i = 2; i <= n; i++) {
    e[i] = e[i - 1] + d[i];
    for (int j = i + i; j <= n; j += i) {
      d[j]++;
      dp[j] = 1;
    }
  }
  if (e[n] < k) {
    cout << "No" << endl;
    return 0;
  }
  cout << "Yes" << endl;
  for (int i = n; i >= 1; i--)
    if (e[i] >= k) m = i;
  k = e[m] - k;
  for (int i = m; i > m / 2 && k > 0; i--) {
    if (dp[i] != 0 && k - d[i] >= 0 && d[i] > 1) {
      dp[i] = 2;
      k -= d[i];
    }
  }
  for (int i = m; i > m / 2 && k > 0; i--) {
    if (dp[i] != 2 && k - d[i] >= 0) {
      dp[i] = 2;
      k -= d[i];
    }
  }
  for (int i = 1; i <= m; i++)
    if (dp[i] != 2) v.push_back(i);
  cout << v.size() << endl;
  for (auto y : v) cout << y << ' ';
  return 0;
}
