Codeforces Round #461 (Div. 2)

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define ll long long
#define mod 1000000007
#define C 0.5772156649
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define pil pair<int,ll>
#define pii pair<int,int>
#define ull unsigned long long
#define base 1000000000000000000
#define fio ios::sync_with_stdio(false);cin.tie(0)

using namespace std;

const double g=10.0,eps=1e-9;
const int N=300000+10,maxn=3000+10,inf=0x3f3f3f3f,INF=0x3f3f3f3f3f3f3f3f;

int d
,e
;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
for(int j=2*i;j<=n;j+=i)
d[j]++;
for(int i=1;i<=n;i++)e[i]=e[i-1]+d[i];
if(e
<k)puts("No");
else
{
vector<int>ans;
int te=e
-k;
for(int i=1;i<=n;i++)
{
if(te>=d[i]+n/i-1&&d[i]==1)
{
te-=d[i]+n/i-1;
for(int j=2*i;j<=n;j+=i)d[j]--;
}
else ans.pb(i);
}
sort(ans.begin(),ans.end());
puts("Yes");
printf("%d\n",ans.size());
for(int i=0;i<ans.size();i++)printf("%d ",ans[i]);
puts("");
}
return 0;
}
/********************

********************/