#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005 
#define inf 0x3f3f3f3f

int n,k;
int C[66][66];
mt19937_64 rnd(19890535);

void print(int x){For(i,0,n-1) if(x>>i&1) putchar('a'+i); cout<<" ";}

int bel[maxn],vis[maxn],tim,U[maxn],cnt,V[maxn],len,id[maxn];
void gen(int n,int k,int*U,int&cnt){
	int x=1; cnt=0;
	while(x<(1<<n)){
		while(x<(1<<n) && __builtin_popcount(x)!=k) ++x;
		if(x>=(1<<n)) break;
		U[++cnt]=x; ++x;
	}
}
int get(int u){
	int x=V[rnd()%len+1],v=0,k=0,tmp=0;
	For(i,0,n-1)if(!(u>>i&1)){if(x>>k&1)v|=(1<<i),++tmp;++k;}
	assert(id[v]);
	return id[v];
}
bool dfs(int u){
	vis[u]=tim;
	For(_,1,100){
		int v=get(U[u]);
		if(vis[v]==tim)continue;
		int t=bel[v];
		bel[u]=v,bel[v]=u;
		if(!t||(vis[t]!=tim&&dfs(t)))return 1;
		bel[u]=0,bel[v]=t,bel[t]=v;
	}
	return 0;
}
void wk2(int k)
{
	gen(n,k,U,cnt); assert(cnt==C[n][k]);
	For(i,1,cnt) id[U[i]]=i;
	len=0;
	For(i,1,cnt) if(U[i]<(1<<(n-k))) V[++len]=U[i];
	int res=0;
	while(res<cnt/2){
		++tim;
		For(i,1,cnt)
			if(!bel[i]) res+=dfs(i);
	}
	For(i,1,cnt)
		if(!bel[i]) cout<<1<<" ",print(U[i]),puts("");
		else if(i<bel[i])cout<<2<<" ",print(U[i]),print(U[bel[i]]),puts("");
}

int U1[maxn],U2[maxn],cnt1,cnt2;
int V1[maxn],V2[maxn],len1,len2,hav[maxn];

int Get(int u){
	int x=V2[rnd()%len2+1],v=0,k=0,tmp=0;
	For(i,0,n-1)if(!(u>>i&1)){if(x>>k&1)v|=(1<<i),++tmp;++k;}
	assert(id[v]);
	return id[v];
}
int go(int u)
{
	vis[u]=tim;
	For(_,1,5){
		int v=Get(U1[u]);
		int t=hav[v];
		bel[u]=v,hav[v]=u;
		if(!t||(vis[t]!=tim&&go(t)))return 1;
		bel[u]=0,hav[v]=t,bel[t]=v;
	}
	return 0;
}
void wk1(int k1,int k2)
{
	gen(n,k1,U1,cnt1);
	gen(n,k2,U2,cnt2); len1=len2=0;
	For(i,1,cnt2) id[U2[i]]=i;
	For(i,1,cnt2) if(U2[i]<(1<<(n-k1))) V2[++len2]=U2[i];
//	For(i,1,cnt1) cout<<U1[i]<<" \n"[i==cnt1];
//	For(i,1,cnt2) cout<<U2[i]<<" \n"[i==cnt2];
	For(i,1,cnt1) bel[i]=0;
	For(i,1,cnt2) hav[i]=0;
	int res=0;
	while(res<cnt1){
		++tim;
		For(i,1,cnt1)
			if(!bel[i]) res+=go(i);
//		For(i,1,cnt1) cout<<bel[i]<<" \n"[i==cnt1];
	}
	For(i,1,cnt1) cout<<2<<" ",print(U1[i]),print(U2[bel[i]]),puts("");
	For(i,1,cnt2) if(!hav[i]) cout<<1<<" ",print(U2[i]),puts(""); 
}

signed main()
{
	n=read(),k=read();
	C[0][0]=1;
	For(i,1,n){
		C[i][0]=1;
		For(j,1,i)C[i][j]=C[i-1][j-1]+C[i-1][j];
	}
	int sum=0;
	if(k%2==1){
		For(i,(k+1)/2,k) sum+=C[n][i]; 
	}else{
		For(i,k/2+1,k) sum+=C[n][i];
		sum+=(C[n][k/2]+1)/2;
	}
	cout<<sum<<'\n';
	if(k%2==0)wk2(k/2);
	For(i,0,(k-1)/2) wk1(i,k-i);
	return 0;
}
/*
8 4
*/