#include <bits/stdc++.h>
using namespace std;
const int N = 510;
int l,r;
int tot;
int cur;
int id[N];
vector <pair<int, int> > e[N];
int sol(int de)
{
	while (cur <= de)
	{
		tot++;
		if(cur > 0)
		{
			pair <int,int> pp;
			pp = make_pair(id[cur - 1], 0);
			e[tot].push_back(pp);
			pp = make_pair(id[cur - 1], 1);
			e[tot].push_back(pp);
		}
		id[cur++] = tot;
	}
	return id[de];
}
int dfs(int de,int l,int r,int s,int t)
{
	if (s <= l && r <= t)
		return sol(de);
	int p = ++tot, mid = (l + r) >> 1;
	if (s < mid) 
	{
		pair <int,int> pp;
		pp = make_pair(dfs(de - 1,l,mid,s,t),0);
		e[p].push_back(pp);
	}
	if (t > mid) 
	{
		pair <int,int> pp;
		pp = make_pair(dfs(de - 1,mid,r,s,t),1);
		e[p].push_back(pp);
	}
		
	return p;
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> l >> r;
	tot = 1;
	int l2,r2;
	for (int i = 0; i <= 20; i++)
	{
		l2 = (1 << i), r2 = (1 << (i + 1));
		l2 = max(l2, l);
		r2 = min(r2, r + 1);
		if (l2 < r2)
		{
			pair <int,int> pp;
			pp = make_pair(dfs(i, (1 << i),1 << (i + 1),l2,r2),1);
			e[1].push_back(pp);
		}
		 
	}
	cout << tot << endl;
	for (int i = 1; i <= tot; i++)
	{
		cout << e[i].size() << " ";
		int siz = e[i].size();
		for (int j = 0;j < siz;j++)
		{
			pair <int,int> pp = e[i][j];
			cout <<	pp.first << " " << pp.second << " ";
		}
			
		cout << "\n"; 
	}
	return 0;
}