#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define endl '\n'
using namespace std;
int Z = 20;
signed main()
{
	IOS;
	int L, R; cin >> L >> R;
	vector<int> l(Z), r(Z);
	for (int i = 0; i < Z; ++i) {
		l[i] = (L >> Z - i - 1) & 1;
		r[i] = (R >> Z - i - 1) & 1;
	}
	int mx = 0;
	bool ok = 0;
	for (int i = 0; i < Z; ++i) {
		if (ok) {
			if (l[i] == 0) mx = max(mx, Z - i);
			if (r[i] == 1) mx = max(mx, Z - i);
		}
		if (l[i] != r[i]) ok = 1;
	}
	// for (int i = 0; i < Z; ++i) cout << l[i] << ' ';
	// cout << endl;
	// for (int i = 0; i < Z; ++i) cout << r[i] << ' ';
	// cout << endl;

	vector<vector<array<int, 2>>> v(200), g(200);
	int idx = mx + 1;
	for (int i = 1; i < mx; ++i) {
		v[i + 1].push_back({i, 0});
		v[i + 1].push_back({i, 1});
	}
	vector<int> a(200), vis(200), one(200);
	queue<int> q;
	q.push(idx);
	a[idx] = 1;
	ok = 0;
	for (int i = 0; i < Z; ++i) {
		if (l[i] != r[i]) ok = 1;
		if (ok) {
			int now = idx;
			v[now].push_back({idx + 1, 0});
			idx++;
			for (int j = i + 1; j < Z - 1; ++j) {
				v[idx].push_back({idx + 1, l[j]});
				if (l[j] == 0) {
					v[idx].push_back({Z - j, 1});
				}
				idx++;
			}
			if (mx != 0)
			{
				v[idx].push_back({1, l[Z - 1]});
				if (l[Z - 1] == 0) v[idx].push_back({1, 1});
			}
			if(mx != 0) v[now].push_back({idx + 1, 1});
			else v[now].push_back({idx,1});
			idx++;
			for (int j = i + 1; j < Z - 1; ++j) {
				v[idx].push_back({idx + 1, r[j]});
				if (r[j] == 1) {
					v[idx].push_back({Z - j, 0});
				}
				idx++;
			}
			if (mx != 0)
			{
				v[idx].push_back({1, r[Z - 1]});
				if (r[Z - 1] == 1) v[idx].push_back({1, 0});
			}
			break;
		} else {
			v[idx].push_back({idx + 1, l[i]});
			idx++;
		}
	}

	int len = 1;
	while (q.size()) {
		int x = q.front();
		q.pop();
		if (vis[x]) continue;
		vis[x] = 1;
		for (auto [u, val] : v[x]) {
			if (one[x] || val == 1) {
				one[u] = 1;
				if (!a[u]) a[u] = ++len;
				g[a[x]].push_back({a[u], val});
			}
			else a[u] = a[x];
			q.push(u);
		}
	}

	cout << len << endl;
	for (int i = 1; i <= len; ++i) {
		sort(g[i].begin(), g[i].end());
		g[i].erase(unique(g[i].begin(), g[i].end()), g[i].end());
		cout << g[i].size() << ' ';
		for(auto [x,y] : g[i]) cout << x << ' ' << y << ' ';
		//for (auto [x, y] : g[i]) cout << i << ' ' << x << ' ' << y << endl;
		cout << endl;
	}

	return 0;
}