#include<bits/stdc++.h>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pb push_back

using namespace std;

inline ll read()
{
	ll f=1,sum=0;char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-1;c=getchar();}
	while (isdigit(c)) {sum=sum*10+c-'0';c=getchar();}
	return sum*f;
}
const int LOG=25;
int cnt,show[LOG];
int e[333][2],leaf;
int build(int deep,int l,int r,int ql,int qr)
{
	// cout<<deep<<' '<<l<<' '<<r<<' '<<ql<<' '<<qr<<endl;
	int mid=(l+r)>>1;
	if (l==r)
	{
		if (!show[deep]) leaf=show[deep]=++cnt;
		return show[deep];
	}
	if (ql==l && qr==r)
	{
		if (show[deep]) return show[deep];
		int nownode=++cnt;
		int ret1=build(deep+1,l,mid,l,mid);
		int ret2=build(deep+1,mid+1,r,mid+1,r);
		e[nownode][0]=ret1;
		e[nownode][1]=ret2;
		show[deep]=nownode;
		return nownode;
	}
	int nownode=++cnt;
	if (qr<=mid)
	{
		int ret=build(deep+1,l,mid,ql,qr);
		e[nownode][0]=ret;
	}
	else if (ql>mid)
	{
		int ret=build(deep+1,mid+1,r,ql,qr);
		e[nownode][1]=ret;
	}
	else
	{
		int ret1=build(deep+1,l,mid,ql,mid);
		int ret2=build(deep+1,mid+1,r,mid+1,qr);
		e[nownode][0]=ret1;
		e[nownode][1]=ret2;
	}
	return nownode;
}
int id[333];
int main()
{
	int L=read(),R=read();
	int now=1;
	while (now<=R) now*=2;
	now--;
	// cout<<2<<endl;
	build(1,0,now,L,R);

	// cout<<cnt<<'\n';
	// for (int i=1;i<=cnt;i++)
	// {
	// 	int num=0;
	// 	if (e[i][0]) num++;
	// 	if (e[i][1]) num++;
	// 	cout<<num<<' ';
	// 	if (e[i][0]) cout<<e[i][0]<<' '<<0<<' ';
	// 	if (e[i][1]) cout<<e[i][1]<<' '<<1<<' ';
	// 	cout<<'\n';
	// }


	queue <int> q;
	q.push(1);
	vector <int> o1;
	while (!q.empty())
	{
		int x=q.front();
		q.pop();
		if (e[x][0]) q.push(e[x][0]),e[x][0]=0;
		if (e[x][1]) o1.push_back(e[x][1]),e[x][1]=0;
	}
	vector <int> hv;
	hv.push_back(1);
	for (int i=2;i<=cnt;i++) if (e[i][0]+e[i][1]) hv.push_back(i);
	hv.push_back(leaf);
	sort(hv.begin(),hv.end());
	int num=0;
	for (auto p:hv) id[p]=++num;
	// cout<<1<<endl;
	cout<<hv.size()<<'\n';
	for (int i:hv)
	{
		int num=0;
		if (e[i][0]) num++;
		if (e[i][1]) num++;
		if (i==1) num+=o1.size();
		cout<<num<<' ';
		if (e[i][0]) cout<<id[e[i][0]]<<' '<<0<<' ';
		if (e[i][1]) cout<<id[e[i][1]]<<' '<<1<<' ';
		if (i==1)
		{
			for (auto p:o1) cout<<id[p]<<' '<<1<<' ';
		}
		cout<<'\n';
	}
	
	return 0;
}