#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)
using namespace std;
inline int read()
{
    int x;cin>>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 2500005
#define inf 0x3f3f3f3f

int l,r;

int ch[maxn][2],rt=1,tot=1,dep[maxn];
bool hav[maxn];

int newn(){
	int u=++tot;
	ch[u][0]=ch[u][1]=0,dep[u]=0;
	hav[u]=0;
	return u;
}

void ins(int x){
	int u=1;
	int t=19;
	while(!(x>>t&1))--t;
	Rep(i,t,0){
		int c=x>>i&1;
		if(!ch[u][c])ch[u][c]=newn();
		u=ch[u][c];
	}
}
int mx=-1;
void dfs(int u){
	dep[u]=0;
	hav[u]=1;
	if(!ch[u][0] && !ch[u][1]) {
		dep[u]=0;
		hav[u]=1;
		return;
	}
	if(ch[u][0])dfs(ch[u][0]);
	if(ch[u][1])dfs(ch[u][1]);
	dep[u]=max(dep[ch[u][0]],dep[ch[u][1]])+1;
	hav[u]=hav[ch[u][0]]&&hav[ch[u][1]] && dep[ch[u][0]]==dep[ch[u][1]];
}

int id[200],cnt;
vector<pii> e[233];
void add(int u,int v,int w){
	e[u].pb(mkp(v,w));
}
int dfs2(int u,bool OP=0){
	int x=0;
	if(OP) x=1;
	else x=++cnt;
//	cout<<"dfs2 "<<u<<" "<<x<<"\n";
	For(i,0,1) if(ch[u][i]){
		if(hav[ch[u][i]]) add(x,-dep[ch[u][i]]-1,i),mx=max(mx,dep[ch[u][i]]);
		else add(x,dfs2(ch[u][i]),i);
	}
	return x;
}

void work()
{
	l=read(),r=read();
	cnt=1;

	for(int i=1; i<=(1<<19); i<<=1){
		int ql=i,qr=i*2-1;
		ql=max(ql,l);
		qr=min(qr,r);
		if(ql>qr) continue;
		tot=0; rt=newn();
		For(x,ql,qr) ins(x);
		dfs(rt);
		dfs2(rt,1);
	}

	id[0]=++cnt;
	For(i,1,mx){
		id[i]=++cnt;
		For(j,0,1)add(id[i],id[i-1],j);
	}
	
	cout<<cnt<<"\n";
	For(i,1,cnt){
		cout<<e[i].size()<<" ";
		for(auto [v,w]:e[i]){
			if(v<0){
				int d=-v-1;
				v=id[d];
			}
			cout<<v<<" "<<w<<" ";
		}
		cout<<"\n";
	}
}

signed main()
{
   // cout<<(4.5*sqrt(2))<<"\n";
    int T=1;
    while(T--)work();
	return 0;
}
/*

*/