#include<bits/stdc++.h>
using namespace std;
#define ll long long  
vector<pair<int,int> > e[10000+10];
vector<int> dil,dir;
const int N = 1e5;

int tot;
int pre[N];
int in[N];

signed main (){
	std::ios::sync_with_stdio(false);  
	cin.tie(NULL); 
	cout.tie(NULL);

	
	int l,r;
	cin>>l>>r;
	while(l)
	{
		dil.push_back(l&1);
		l>>=1;
	}
	while(r)
	{
		dir.push_back(r&1);
		r>>=1;
	}


	while(dil.size() != dir.size())
	{
		dil.push_back(0);
	}

	reverse(dil.begin(),dil.end());
	reverse(dir.begin(),dir.end());
	
	int lena = dil.size();
	for(int i=1;i<lena;i++)
	{
		e[i].push_back({i+1,0});
		e[i].push_back({i+1,1});
	}
	int en = lena;
	in[en] = 1;
	
	int be = lena + 1;
	
	int tot = lena+1;
	

	
	for(int i=0;i<lena;i++)
	{
		if(i == lena - 1)
		{
			e[tot].push_back({en,dil[i]});
			if(dir[i] != dil[i])
				e[tot].push_back({en,dir[i]});
			break;
			
		}
		if(dil[i] == dir[i])
		{
			e[tot].push_back({tot+1,dil[i]});
			tot ++;
			
		}
		else 
		{
			int now = tot ;

			e[now].push_back({tot + 1,dil[i]});
			tot ++;
			
			for(int j = i+1;j<lena;j++)
			{
				if(j == lena - 1)
				{	e[tot].push_back({en,dil[j]});
					
					if(dil[j] == 0)
					{
						e[tot].push_back({j+1,1});
						in[j+1] = 1;
						
					}
				}
				else {
				
					e[tot].push_back({tot+1,dil[j]});
					
					if(dil[j] == 0)
					{
						e[tot].push_back({j+1,1});
						in[j+1] = 1;
						
					}
					tot ++;	
				}
			}
			e[now].push_back({tot + 1,dir[i]});
			tot ++;
			for(int j = i+1;j<lena;j++)
			{
				if(j == lena - 1)
				{	e[tot].push_back({en,dir[j]});
					
					
					if(dir[j] == 1)
					{
						e[tot].push_back({j+1,0});
						in[j+1] = 1;
						
					}
				}
				else {

					
					e[tot].push_back({tot+1,dir[j]});
					
					if(dir[j] == 1)
					{
						e[tot].push_back({j+1,0});
						in[j+1] = 1;
						
					}
					tot ++;	
				}
			}
			break;
			
		}
		
	}
	for(int i=1;i<=lena;i++)
	{
		if(in[i] != 1)
			in[i] = -1;
		else
			break;
			
	}
		
	queue<int> q;
	q.push(be);

	while(!q.empty())
	{
		auto u = q.front();
		q.pop();

		for(auto [v,w]:e[u])
		{
			if(w == 0)
			{
				in[v] = -1;
				
				q.push(v);
			}
			else if(u != be )
			{
				e[be].push_back({v,1});
			}
			
		}
	}
	
	int sum = 0 ;
	for(int i=1;i<=tot;i++)
		if(in[i] != -1)
			sum ++;
	cout<<sum<<endl;
	for(int i=1;i<=tot;i++)
	{
		if(in[i] == -1)
			pre[i] += -1;
		pre[i] += pre[i-1];
		
	}
	auto cmp=[&](pair<int,int> x,pair<int,int> y)
	{
		return x.second > y.second ;
	};
	
	sort(e[be].begin(),e[be].end(),cmp);
	while(e[be].rbegin()->second == 0)
		e[be].pop_back();
	

	
	for(int i=1;i<=tot;i++)
	{
		vector<pair<int,int> > now ;
		if(in[i] == -1)
			continue ;
			
		for(auto [u,v]:e[i])
		{
			if(in[u] != -1 )
				now.push_back({u + pre[u],v});
		}
		cout<<now.size()<<" ";
		for(auto [u,v]:now)
			cout<<u<<' '<<v<<' ';
		cout<<endl;
		
	}

	
}