#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

map<tuple<ll, ll, ll>, ll> mind;

const ll LOG = 30;

ll solve(vector<tuple<ll, ll, ll>>& all, ll l, ll r, ll& lst, ll ni = -2) {
	if (mind.find(make_tuple(l, r, ni)) != mind.end()) {
		return mind[make_tuple(l, r, ni)];
	}
	ll nv = lst;
	mind[make_tuple(l, r, ni)] = nv;
	lst++;
	if (ni == -2) {
		for (ll i = LOG; i >= 0; i--) {
			if ((r >> i) & 1) {
				ll newr = (1 << i);
				all.emplace_back(nv, solve(all, max(newr, l) ^ newr, r ^ newr, lst, i - 1), 1);
				if (l >= newr) {
					break;
				}
				r = newr - 1;
			}
		}
	} else {
		if (ni != -1) {
			ll nowl = (1 << ni);
			if (r >= nowl) {
				all.emplace_back(nv, solve(all, max(l, nowl) ^ nowl, r ^ nowl, lst, ni - 1), 1);
			}
			if (nowl > l) {
				all.emplace_back(nv, solve(all, l, min(r, nowl - 1), lst, ni - 1), 0);
			}
		}
	}
	return nv;
}

int32_t main() {
	std::cin.tie(nullptr)->sync_with_stdio(false);

	ll l, r;
	cin >> l >> r;
	ll lst = 1;
	vector<tuple<ll, ll, ll>> all;
	solve(all, l, r, lst);
	vector<vector<pair<ll, ll>>> to(lst);
	for (auto[a, b, c] : all) {
		to[a].emplace_back(b, c);
	}
	cout << lst - 1 << '\n';
	for (ll i = 1; i < lst; i++) {
		cout << to[i].size() << ' ';
		for (auto[b, c] : to[i]) {
			cout << b << ' ' << c << ' ';
		}
		cout << '\n';
	}
}