#include<iostream>
#include<vector>
using namespace std;
int l,r,num=0;
vector<pair<int,bool> > e[110];
void Solve(int p,int len,int now)
{
	int L=now,R=now|(1<<len)-1;
	if(l<=L&&R<=r)
	{
		num=max(num,len-1);
		return;
	}
	if(l>R||r<L)
	{
		return;
	}
	if(len==1)
	{
		return;
	}
	for(int i=0;i<2;i++)
	{
		Solve(num,len-1,now|i*(1<<len-1));
	}
}
bool solve(int p,int len,int now)
{
	int L=now,R=now|(1<<len)-1;
	if(l<=L&&R<=r)
	{
		e[p].push_back({len-1,0});
		e[p].push_back({len-1,1});
		return 1;
	}
	if(l>R||r<L)
	{
		return 0;
	}
	if(len==1)
	{
		e[p].push_back({0,
		!(l<=now&&now<=r)});
		return 1;
	}
	for(int i=0;i<2;i++)
	{
		e[p].push_back({++num,i});
		if(!solve(num,len-1,now|i*(1<<len-1)))
		{
			e[p].pop_back();
			num--;
		}
	}
	return 1;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>l>>r;
	for(int i=1;i<20;i++)
	{
		Solve(20,i,1<<i);
	}
	for(int i=1;i<=num;i++)
	{
		e[i].push_back({i-1,0});
		e[i].push_back({i-1,1});
	}
	int now=++num;
	if(l==1)
	{
		e[now].push_back({0,1});
	}
	if(r>1)
	{
		e[now].push_back({++num,1});
		now=num;
		for(int i=1;i<20;i++)
		{
			solve(now,i,1<<i);
		}
	}
	cout<<num+1<<endl;
	for(int i=0;i<=num;i++)
	{
		cout<<e[i].size()<<" ";
		for(int j=0;j<e[i].size();j++)
		{
			cout<<e[i][j].first+1<<" "
			<<e[i][j].second<<" ";
		}
		cout<<endl;
	}
	return 0;
}