#include <bits/stdc++.h>
#define cerr cout << "in " << __LINE__ << "\t: "
using namespace std;
#define lg(x) (31 ^ __builtin_clz(x))
int tot = 0;
vector<pair<int, int>> e[110];
int solve(int dep, int l, int r, int flag = 0) {
	if (dep == -1) return 0;
	if (l == 0 && r == (1 << dep + 1) - 1)
		return -dep - 1;
	if (flag) {
		int res = ++tot;
		if (!(l >> dep & 1)) {
			int tmp = solve(dep - 1, l, min(r, (1 << dep) - 1), 1);
			e[res].push_back({tmp, 0});
		}
		if (r >> dep & 1) {
			int tmp = solve(dep - 1, max(l, 1 << dep) % (1 << dep), r % (1 << dep), 1);
			e[res].push_back({tmp, 1});
		}
		return res;
	}
	if (!(l >> dep & 1)) {
		int res = solve(dep - 1, l, min(r, (1 << dep) - 1), 0);
		if (r >> dep & 1) {
			int tmp = solve(dep - 1, max(l, 1 << dep) % (1 << dep), r % (1 << dep), 1);
			e[res].push_back({tmp, 1});
		}
		return res;
	}
	int res = ++tot;
	if (r >> dep & 1) {
		int tmp = solve(dep - 1, max(l, 1 << dep) % (1 << dep), r % (1 << dep), 1);
		e[res].push_back({tmp, 1});
	}
	return res;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int l, r;
	cin >> l >> r;
	int dep = lg(r);
	int mn = min(0, solve(dep, l, r));
	for (int i = 1; i <= tot; i++)
		for (auto &[v, w] : e[i]) {
			mn = min(mn, v);
			if (v <= 0) v = tot + 1 - v;
		}
	for (int i = -1; i >= mn; i--) {
		e[tot + 1 - i].push_back({tot - i, 0});
		e[tot + 1 - i].push_back({tot - i, 1});
	}
	cout << tot + 1 - mn << "\n";
	for (int i = 1; i <= tot + 1 - mn; i++) {
		cout << e[i].size() << " ";
		for (auto [x, y] : e[i])
			cout << x << " " << y << " ";
		cout << "\n";
	}
	return 0;
}