#include<bits/stdc++.h>
using namespace std;

const int MAXN=5e2+5;

int L,R,s=1,tot=1;
struct edge{
	int v,tag;
};
vector<edge>e[MAXN];
int fullchain[32];
vector<int>End;
int tag[MAXN],atag[MAXN];

int bits(int x){
	int cnt=0;
	while(x){cnt++,x>>=1;}
	return cnt;
}

void connect(int x,int y){
	vector<int>X,Y;
	while(x){X.push_back(x&1);x>>=1;}reverse(X.begin(),X.end());
	while(y){Y.push_back(y&1);y>>=1;}reverse(Y.begin(),Y.end());
	int nX=X.size(),nY=Y.size(),cur=s,from=-1,tag=-1,z=-1;
	vector<int>zero;
	for(int i=0;i<nX;i++){
		if(from!=-1&&X[i]==0){
			if(z==-1)z=i;
			zero.push_back(cur);
		}
		if(from==-1&&X[i]!=Y[i])
			from=i,tag=cur;
		e[cur].push_back({++tot,X[i]});cur=tot;
	}
	End.push_back(cur);
	if(z!=-1){
		int len=nX-1-z;
		for(int i=0;i<=len;i++){
			if(fullchain[i])continue;
			fullchain[i]=++tot;
			if(i>0)
				e[fullchain[i]].push_back({fullchain[i-1],0}),
				e[fullchain[i]].push_back({fullchain[i-1],1});
			else
				End.push_back(fullchain[i]);
		}
		for(int i=0;i<zero.size();i++){
			if(i==0)e[zero[i]].push_back({fullchain[len],1});
			else{
				len-=zero[i]-zero[i-1];
				e[zero[i]].push_back({fullchain[len],1});
			}
		}	
	}
	if(tag!=-1){
		e[tag].push_back({++tot,1});
		cur=tot;
		int o=-1;
		vector<int>one;
		for(int i=from+1;i<nY;i++){
			if(Y[i]==1){
				if(o==-1)o=i;
				one.push_back(cur);
			}
			e[cur].push_back({++tot,Y[i]});
			cur=tot;
		}
		End.push_back(cur);
		if(o!=-1){
			int len=nY-1-o;
			for(int i=0;i<=len;i++){
				if(fullchain[i])continue;
				fullchain[i]=++tot;
				if(i>0)
					e[fullchain[i]].push_back({fullchain[i-1],0}),
					e[fullchain[i]].push_back({fullchain[i-1],1});
				else
					End.push_back(fullchain[i]);
			}
			for(int i=0;i<one.size();i++){
				if(i==0)e[one[i]].push_back({fullchain[len],0});
				else{
					len-=one[i]-one[i-1];
					e[one[i]].push_back({fullchain[len],0});
				}
			}	
		}
	}
}

int main(){
	cin>>L>>R;
	int lenL=bits(L),lenR=bits(R);
	if(lenL==lenR)connect(L,R);
	else{
		int ll=lenL,rr=lenR-1;
		if(ll<rr){
			int cur=s,tmp;
			for(int i=1;i<=ll+1;i++){
				if(i==1){
					e[cur].push_back({++tot,1});
					cur=tot,tmp=tot;
				}else{
					e[cur].push_back({++tot,0});
					e[cur].push_back({tot,1});
					cur=tot;
				}
				fullchain[ll+1-i]=cur;
			}
			End.push_back(cur);
			for(int i=ll+1;i<rr;i++){
				e[s].push_back({++tot,1});
				cur=tot;
				e[cur].push_back({tmp,0});
				e[cur].push_back({tmp,1});
				tmp=cur;
				fullchain[i]=cur;
			}
		}
		connect(L,(1<<ll)-1);
		connect(1<<rr,R);
	}
	int n=1;
	for(auto x:End){atag[x]=tot-End.size()+1;}
	for(int i=1;i<=tot;i++){if(!atag[i]){tag[n]=i;atag[i]=n++;}}
	cout<<n<<"\n";
	for(int i=1;i<n;i++){
		cout<<e[tag[i]].size()<<" ";
		for(auto p:e[tag[i]])cout<<atag[p.v]<<" "<<atag[p.tag]<<" ";
		cout<<"\n";
	}
	cout<<0;
}