#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 3e5 + 5;
int l, r, idx = 1, tmp, mx;
vector <pair <int, int> > e[105];
void out() {
	if (mx == 0) {
		bool flg = false;
		for (int i = 1; i <= idx; ++i) for (auto j : e[i]) if (j.first == 13133) flg = true;
		cout << idx + flg << '\n';
		for (int i = 1; i <= idx; ++i) {
			cout << e[i].size() << ' ';
			for (auto j : e[i]) {
				if (j.first == 13133) cout << idx + 1 << ' ' << j.second << ' ';
				else cout << j.first << ' ' << j.second << ' ';
			}
			cout << '\n';
		}
		if (flg) {
			cout << 0 << '\n';
		}
		return;
	}
	cout << idx + mx << "\n0\n";
	for (int i = 2; i <= mx; ++i) cout << 2 << ' ' << i - 1 << ' ' << 0 << ' ' << i - 1 << ' ' << 1 << '\n';
	for (int i = 1; i <= idx; ++i) {
		cout << e[i].size() << ' ';
		for (auto j : e[i]) {
			if (j.first == 13133) cout << 1 << ' ' << j.second << ' ';
			else if (j.first > 0) cout << j.first + mx << ' ' << j.second << ' ';
			else cout << -j.first << ' ' << j.second << ' ';
		}
		cout << '\n';
	}
}
int lowbit(int x) {
	return x & (-x);
}
int popcount(int x) {
	int ret = 0;
	for (int i = x; i; i -= lowbit(i)) ++ret;
	return ret; 
}
signed main() {
bool flg = false;
	cin >> l >> r;
	tmp = (int) log2(r);
	for (int i = (1 << tmp); i && (l & i) == (r & i); i >>= 1) {
		e[idx].push_back({idx + 1, (bool) (l & i)});
		++idx;
		if (l & i) l -= i, r -= i, flg = true; 
	}
	if (r == 0) {
		out();
		return 0;
	} 
	int k = idx;
	++r;
	if (flg && popcount(r) != 1) e[idx].push_back({idx + 1, 0}), ++idx;
	for (int i = (int) log2(r); i; --i) {
//		cout << i << ' ' << (bool) (l & (1 << (i - 1))) << '\n';
		if (l & (1 << (i - 1))) flg = true;
		if (!(l & (1 << (i - 1)))) {
			if (flg) e[idx].push_back({-i, 1});
			else e[k].push_back({-i, 1});
			mx = max(mx, i);
		}
		if (i == 1) {
			e[idx].push_back({13133, (bool) (l & (1 << (i - 1)))});
			break;
		}
		if (!((!(l & (1 << (i - 1)))) && (!flg))) e[idx].push_back({idx + 1, (bool) (l & (1 << (i - 1)))}), ++idx;
	}
	if (popcount(r) == 1) {
		out();
		return 0;
	}
	--r;
	e[k].push_back({idx + 1, 1});
	++idx;
	for (int i = (int) log2(r); i; --i) {
		if (r & (1 << (i - 1))) e[idx].push_back({-i, 0}), mx = max(mx, i);
		if (i == 1) {
			e[idx].push_back({13133, (bool) (r & (1 << (i - 1)))});
			break;
		}
		e[idx].push_back({idx + 1, (bool) (r & (1 << (i - 1)))});
		++idx;
	}
	out();
}