#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
	int l, r;
	cin >> l >> r;



	int bitl = __lg(l), bitr = __lg(r);
	vector<vector<array<int, 2>>> E(205);
	if (l == r) {
		int now = 1;
		for (int i = bitl; i >= 0; --i) {
			E[now].push_back({now + 1, l >> i & 1});
			now++;
		}
		cout << now << '\n';
		for (int i = 1; i <= now; ++i) {
			cout << E[i].size() << ' ';
			for (auto [v, w] : E[i]) {
				cout << v << ' ' << w << ' ';
			}
			cout << '\n';
		}
		return ;
	}
	vector<pair<string, int>> build;
	auto ts = [&]() {
		for (auto [a, b] : build) {
			cout << a << ' ' << b << '\n';
		}
		cout << '\n';
	};
	bitl++, bitr++;
	if (bitl == bitr) {
		int BIT = 0;

		for (int i = bitl; i >= 1; --i) {
			int bit = i - 1;
			if (((l >> bit) ^ (r >> bit)) != 0) {
				BIT = i;
				break;
			}
		}
		string s ;
		for (int i = bitr; i >= BIT; --i) {
			s +=  ((r >> (i - 1)) & 1) + '0';
		}
		for (int i = BIT - 1; i >= 1; --i) {
			if ((r >> (i - 1)) & 1) {
				build.push_back({s + '0', i - 1});
				s += '1';
			}
			else {
				s += '0';
			}
		}
		build.push_back({s, 0});

		if (BIT == 1) {
			string ss = "";
			for (int i = bitl; i >= 1; --i) {
				ss +=  ((l >> (i - 1)) & 1) + '0';
			}
			build.push_back({ss, 0});
		}
		else {
			int i = 1;
			while (((l >> (i - 1)) & 1 ) != 1 && i > BIT) i++;
			s = "";
			if (!(i > BIT - 1)) {
				for (int j = i; j <= bitl; ++j) {
					s +=   (l >> (j - 1) & 1) + '0';
				}
				reverse(s.begin(), s.end());
				build.push_back({s, i - 1});
			}
			while (1) {

				while (i <= BIT - 1 && ((l >> (i - 1)) & 1) == 1) i++;
				if (i > BIT - 1) break;
				s = "1";
				for (int j = i + 1; j <= bitl; ++j) {
					s +=   (l >> (j - 1) & 1) + '0';
				}
				reverse(s.begin(), s.end());
				build.push_back({s, i - 1});
				++i;
			}
		}
		//ts();

	}
	else {
		for (int i = bitl + 1; i <= bitr - 1; ++i) {
			build.push_back({"1", i - 1});
		}
		string s = "1";
		for (int i = bitr - 1; i >= 1; --i) {
			if ((r >> (i - 1)) & 1) {
				build.push_back({s + '0', i - 1});
				s += '1';
			}
			else {
				s += '0';
			}
		}
		build.push_back({s, 0});


		int i = 1;
		while (((l >> (i - 1)) & 1 ) != 1) i++;
		s = "";
		for (int j = i; j <= bitl; ++j) {
			s +=   (l >> (j - 1) & 1) + '0';
		}
		reverse(s.begin(), s.end());
		build.push_back({s, i - 1});
		while (1) {

			while (i <= bitl && ((l >> (i - 1)) & 1) == 1) i++;
			if (i > bitl) break;
			s = "1";
			for (int j = i + 1; j <= bitl; ++j) {
				s +=   (l >> (j - 1) & 1) + '0';
			}
			reverse(s.begin(), s.end());
			build.push_back({s, i - 1});
			++i;
		}
		//ts();

	}




	int tot = 1;
	vector<int> id(21, -1);
	int cnt = 104;
	for (int i = 1; i <= 20; ++i) {
		id[i] = ++cnt;
	}
	vector<array<int, 2>> shu(200000); //2e5//////
	vector<array<int, 3>> sb;
	int mx = 0;
	for (auto [a, b] : build) {
		//a 字典树
		int res = 1;
		for (int i = 0; i < (int)a.size() - 1; i++)
		{
			char c = a[i];
			int x = c - '0';
			// cerr << x << '\n';
			if (!shu[res][x])
			{
				shu[res][x] = ++tot;
				E[res].push_back({tot, x});
			}
			res = shu[res][x];
		}
		sb.push_back({res, b, a[(int)a.size() - 1] - '0'});
		mx = max(b, mx);
	}


	///ts();
	for (int i = 1; i <= mx; ++i) {
		id[i] = ++tot;
	}
	for (int i = mx; i >= 2; --i) {
		E[id[i]].push_back({id[i - 1], 0});
		E[id[i]].push_back({id[i - 1], 1});
	}
	id[0] = ++tot;
	if (id[1] != -1) {
		E[id[1]].push_back({id[0], 0});
		E[id[1]].push_back({id[0], 1});
	}
	for (auto [u, v, w] : sb) {
		// cerr << w << '\n';
		E[u].push_back({id[v], w});
	}
	cout << tot << '\n';
	for (int i = 1; i <= tot; ++i) {
		cout << E[i].size() << ' ';
		for (auto [v, w] : E[i]) {
			cout << v << ' ' << w << ' ';
		}
		cout << '\n';
	}


}
signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}