#ifdef local
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#endif
// #pragma comment(linker, "/STACK:102400000,102400000")

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#ifndef local
#define endl '\n'
#endif

#define pb emplace_back
#define fi first
#define se second
#define rep(i, l, r) for (long long i = l; i <= r; i++)
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef pair<ll, ll> P;
typedef pair<P, ll> PP;
const double pi = acos(-1);
typedef __int128_t int128;
const db eps = 1e-9;
std::mt19937_64 rng(time(0));
ll my_random(ll l, ll r)
{

	uniform_int_distribution<int> range(l, r);
	return range(rng);
}
void __()
{
#ifdef local
	system("pause");
#endif
}
ll qp(ll a, ll b, ll mod)
{
	ll ans = 1;
	while (b)
	{
		if (b & 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ans;
}

const int maxn = 1e5 + 10;
const ll mod = 998244353;

int trie[110][2];
set<P> val[110];
int nodenum = 1;
vector<P> edge[110];
int endpos;
void insert(vector<int> s, int v)
{
	int len = s.size();
	int st = 1;
	if (s.size() == 1)
	{
		val[1].insert(P{s[0], v});
	}
	else

		for (int i = 0; i < len - 1; i++)
		{
			if (trie[st][s[i]] == 0)
				trie[st][s[i]] = ++nodenum;
			st = trie[st][s[i]];
			if (i == len - 2)
			{
				// cout << st << endl;
				val[st].insert(P{s[len - 1], v});
			}
		}
}
void dfs(int i)
{
	// cout << "YY " << i << endl;
	for (int j = 0; j <= 1; j++)
	{
		if (trie[i][j] != 0)
		{
			dfs(trie[i][j]);
			edge[i].pb(P{trie[i][j], j});
		}
	}
	if (val[i].size() != 0)
	{
		// cout << "XX " << i << endl;
		for (auto x : val[i])
			edge[i].pb(P{endpos - x.se, x.fi});
	}
}

struct node
{
	vector<int> l, r;
	node() {};
	node(vector<int> _l, vector<int> _r) { l = _l, r = _r; };
};
vector<node> vec;
void wk(vector<int> bitl, vector<int> bitr)
{
	int start = bitl.size() - 1;
	for (int i = 0; i < bitl.size() - 1; i++)
	{
		if (bitl[i] != bitr[i])
		{
			start = i;
			break;
		}
	}
	if (bitl[bitl.size() - 1] == 0)
	{
		vector<int> vec2 = bitl;
		vec2[bitl.size() - 1] = 1;
		vec.pb(node(bitl, vec2));
	}
	else
	{
		vec.pb(node(bitl, bitl));
	}
	for (int i = bitl.size() - 2; i > start; i--)
	{
		if (bitl[i] == 0)
		{
			vector<int> b2 = bitl;
			b2[i] = 1;
			for (int j = i + 1; j < b2.size(); j++)
				b2[j] = 0;

			vector<int> b3 = b2;
			for (int j = i + 1; j < b3.size(); j++)
				b3[j] = 1;
			vec.pb(node(b2, b3));
			bitl = b3;
		}
	}
	vector<int> l1 = bitr;
	for (int i = start + 1; i < bitr.size(); i++)
		l1[i] = 0;
	for (int i = start + 1; i < bitr.size() - 1; i++)
	{
		if (bitr[i] == 1)
		{
			vector<int> b2 = bitr;
			b2[i] = 0;
			for (int j = i + 1; j < b2.size(); j++)
				b2[j] = 1;
			vec.pb(node(l1, b2));

			vector<int> b3 = bitr;
			for (int j = i + 1; j < b3.size(); j++)
				b3[j] = 0;
			l1 = b3;
		}
	}
	vec.pb(node(l1, bitr));
}
int main()
{
	IOS;
	int l, r;
	cin >> l >> r;
	vector<int> bitl, bitr;
	int bl = 0, br = 0;
	int l2 = l, r2 = r;
	while (l)
		bitl.pb(l % 2), bl++, l >>= 1;
	while (r)
		bitr.pb(r % 2), br++, r >>= 1;
	for (int i = bl + 1; i <= br; i++)
		bitl.pb(0);
	reverse(bitl.begin(), bitl.end());
	reverse(bitr.begin(), bitr.end());
	if (l2 == r2)
		vec.pb(node(bitl, bitr));
	else if (r2 - l2 == 1 && l2 % 2 == 0)
		vec.pb(node{bitl, bitr});
	else
		wk(bitl, bitr);
	int mxsuf = 0;
	// for (auto x : vec)
	// {
	// 	for (auto u : x.l)
	// 		cout << u;
	// 	cout << " ";
	// 	for (auto u : x.r)
	// 		cout << u;
	// 	cout << endl;
	// }
	for (auto x : vec)
	{
		int n = x.l.size();
		vector<int> common;
		int need = 0;

		bool flag = 0;
		for (int i = 0; i < n; i++)
			if (x.l[i] == x.r[i])
			{
				if (x.l[i] == 1)
					flag = 1;
				if (flag)
					common.pb(x.l[i]);
			}
			else
			{
				need = n - i;
				break;
			}

		insert(common, need);
		// for (auto x : common)
		// 	cout << x;
		// cout << " ";
		// cout << "XX " << need << endl;
		mxsuf = max(mxsuf, need);
	}
	for (int i = 1; i <= mxsuf; i++)
		edge[nodenum + i].pb(P{nodenum + i + 1, 0}), edge[nodenum + i].pb(P{nodenum + i + 1, 1});
	endpos = nodenum + mxsuf + 1;
	dfs(1);
	// cout << nodenum << " " << endpos << endl;
	// for (int i = 1; i < nodenum; i++)
	//{
	//	cout << trie[i][0] << " " << trie[i][1] << endl;
	// }
	cout << endpos << endl;
	for (int i = 1; i <= endpos; i++)
	{
		cout << edge[i].size() << " ";
		for (auto x : edge[i])
			cout << x.fi << " " << x.se << " ";
		cout << endl;
	}
	__();
	return 0;
}