#include <bits/stdc++.h>
#define ll long long
#define PII pair<int,int>
#define mp(a,b) make_pair(a,b)
using namespace std;
template<typename T>void read(T &x)
{
    T f=1;x=0;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}
    x*=f;
}
int Edgecnt,head[8000005],To[8000005],nxt[8000005],W[8000005];
void AddEdge(int a,int b,int c)
{
//	cerr<<a<<" "<<b<<" "<<c<<endl;
	To[Edgecnt]=b; nxt[Edgecnt]=head[a]; W[Edgecnt]=c; head[a]=Edgecnt++;
	To[Edgecnt]=a; nxt[Edgecnt]=head[b]; W[Edgecnt]=0; head[b]=Edgecnt++;
}
int S,T,cur[8000005],dis[8000005];
bool BFS()
{
	for(int i=1;i<=T;i++) dis[i]=0;
	queue<int>Q;Q.push(S);cur[S]=head[S];dis[S]=1;
	while(!Q.empty())
	{
		int u=Q.front();Q.pop();
		for(int i=head[u];~i;i=nxt[i])
		{
			int v=To[i];
			if(!W[i]||dis[v]) continue;
			dis[v]=dis[u]+1; cur[v]=head[v];
			if(v==T) return true;
			Q.push(v);
		}
	}
	return false;
}
int DFS(int u,int Lim)
{
	if(u==T) return Lim;
	int res=0;
	for(int i=cur[u];~i&&res<Lim;i=nxt[i])
	{
		int v=To[i]; cur[u]=i;
		if(!W[i]||dis[v]!=dis[u]+1) continue;
		int Tmp=DFS(v,min(Lim-res,W[i]));
		if(!Tmp) dis[v]=-1;
		else res+=Tmp,W[i]-=Tmp,W[i^1]+=Tmp;
	}
	return res;
}
int Dinic()
{
	int Tmp,res=0;
	while(BFS()) 
		while((Tmp=DFS(S,1e9))) res+=Tmp;
	return res;
}
int Ans[1000005];
int main() {
	memset(head,-1,sizeof(head));
	int n,k;
	read(n);read(k);//I don't care about n
	S=2*k+1; T=S+1; 
	for(int i=1;i<=2*k-1;i+=2)
	{
		AddEdge(S,(i+1)/2,1); AddEdge(k+(i+1)/2,T,1);
		for(int j=0;(1<<j)<=4*k-2;j++)
		{
			if((1<<j)-i<=0) continue;
			if((1<<j)-i>2*k-1) break;
			AddEdge((i+1)/2,k+((1<<j)-i+1)/2,1);
		}
	}
	int res=Dinic();
	printf("%d\n",res);
	for(int i=0;i<Edgecnt;i+=2)
	{
		int u=To[i^1],v=To[i],w=W[i];
		if(1<=u&&u<=k&&k+1<=v&&v<=2*k&&!w) Ans[u]=(v-k);
	}
	for(int i=1;i<=k;i++) printf("%d\n",Ans[i]);
	return 0;
}
/*
瑶草一何碧，春入武陵溪。溪上桃花无数，花上有黄鹂。我欲穿花寻路，直入白云深处，浩气展虹霓。只恐花深里，红露湿人衣。
坐玉石，欹玉枕。拂金徽。谪仙何处，无人伴我白螺杯。我为灵芝仙草，不为朱唇丹脸，长啸亦何为。醉舞下山去，明月逐人归。
*/