#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

const int M = 1 << 25;

struct edge{
	int v, u, c;
};

vector<edge> e;
int mn;

int get2(int v, int l, int r, int L, int R){
	if (L >= R)
		return -1;
	if (l == L && r == R){
		int x = 20 - __builtin_ctz(r - l);
		mn = min(mn, x);
		return M + x;
	}
	int m = (l + r) / 2;
	int t;
	if ((t = get2(v * 2, l, m, L, min(m, R))) != -1)
		e.push_back({v, t, 0});
	if ((t = get2(v * 2 + 1, m, r, max(m, L), R)) != -1)
		e.push_back({v, t, 1});
	return v;
}

void get(int v, int l, int r, int L, int R){
	if (L >= R) return;
	if (l == r - 1) return;
	int m = (l + r) / 2;
	get(v * 2, l, m, L, min(m, R));
	int t;
	if ((t = get2(v * 2 + 1, m, r, max(m, L), R)) != -1)
		e.push_back({0, t, 1});
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int l, r;
	cin >> l >> r;
	++r;
	mn = 20;
	get(1, 0, 1 << 20, l, r);
	fore(i, mn, 20){
		e.push_back({M + i, M + i + 1, 0});
		e.push_back({M + i, M + i + 1, 1});
	}
	vector<int> xs;
	for (auto it : e){
		xs.push_back(it.v);
		xs.push_back(it.u);
	}
	sort(xs.begin(), xs.end());
	xs.resize(unique(xs.begin(), xs.end()) - xs.begin());
	for (auto& it : e){
		it.v = lower_bound(xs.begin(), xs.end(), it.v) - xs.begin();
		it.u = lower_bound(xs.begin(), xs.end(), it.u) - xs.begin();
	}
	int n = xs.size();
	vector<vector<edge>> g(n);
	for (auto it : e) g[it.v].push_back(it);
	cout << n << '\n';
	forn(i, n){
		cout << g[i].size();
		for (auto it : g[i]) cout << " " << it.u + 1 << " " << it.c;
		cout << '\n';
	}
}