#include<bits/stdc++.h>
#define int long long
#define rep(i,j,k) for(int i=(j),_i=(k);i<=_i;++i)
#define drp(i,j,k) for(int i=(j),_i=(k);i>=_i;--i)
using namespace std;
inline int read() {
	int x=0,f=0; char ch=getchar();
	while(!isdigit(ch)) f|=ch=='-',ch=getchar();
	while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}
//--------------------------------------------//
const int N=1e6+5;

int id[N],rk[N],pos;
int cnt=22,S=21,T=22;
vector<pair<int,int>>edge[N];

void add_edge(int x,int y,int w) {
	edge[x].push_back(make_pair(y,w));
}

int dfs(int L,int R,int w,int tpye) {
	if(w==-1) return T;
	if(!L&&R==(1<<(w+1))-1) return w+1;
	int cur=tpye?++cnt:S;
	if(R>=(1<<w)) {
		int rs=dfs(max(0ll,L-(1<<w)),R-(1<<w),w-1,1);
		add_edge(cur,rs,1);
	}
	if(L<(1<<w)) {
		int ls=dfs(L,min((1ll<<w)-1,R),w-1,tpye);
		if(tpye) add_edge(cur,ls,0);
	}
	return cur;
}

int vis[N];
void sou(int u,int num){
	if(u==T) vis[num]=1;
	for(auto nex:edge[u]) {
		if(!num&&!nex.second) {
			puts("no");
			puts("exist pre 0");
		}
		sou(nex.first,(num<<1)|nex.second); 
	}
}

int met[N];
void upd(int u) {
	id[rk[u]=++pos]=u;
	met[u]=1;
	for(auto nex:edge[u]) {
		int v=nex.first;
		if(met[v]) continue;
		upd(v);
	}
}

signed main() {
	// freopen("A.in","r",stdin);
	// freopen("A.out","w",stdout);
	add_edge(1,T,0);
	add_edge(1,T,1);
	rep(i,2,20) {
		add_edge(i,i-1,0);
		add_edge(i,i-1,1);
	}
	
	int L=read(),R=read();
	// int L=1,R=100000;
	dfs(L,R,19,0);
	
	sou(S,0);
	rep(i,1,N-1) {
		if(i>=L&&i<=R&&!vis[i]) printf("no\n%lld cant be find\n",i);
		if((i<L||i>R)&&vis[i]) printf("no\n%lld shouldn't be find\n",i);
	}
	// puts("YES");

	upd(S);
	
	printf("%lld\n",pos);
	rep(i,1,pos) {
		int u=id[i];
		printf("%lld ",edge[u].size());
		for(pair<int,int>tmp:edge[u])
		  printf("%lld %lld ",rk[tmp.first],tmp.second);
		printf("\n");
	}
}