#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define ll long long
#define all(v) v.begin(),v.end()
#define sz(v) ((ll)v.size())
#define V vector
#define vi V<int>
#define vll V<ll>
#define eb emplace_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define A array
#define pb push_back
#define mset multiset
#define gpumap __gnu_pbds::gp_hash_table
#define ccumap __gnu_pbds::cc_hash_table
#define ui unsigned int
#define ull unsigned ll
#define i128 __int128
#define whtest if (test)
#define cerr whtest cerr
#define freopen whtest freopen
using namespace std;

constexpr int test = 0;

namespace jhsy {
	struct Seg {
#define ls (x<<1)
#define rs (ls|1)
		int n,cnt{}; vi id,leaf;
		Seg(int n):n(n),id(n*4),leaf(n*4) {}
		int work(int x,int l,int r,int pl,int pr,V<V<pii>> &vec,V<V<pii>> &sp) {
			if (pl >= r || pr <= l) {
				return -1;
			}
			if (pl <= l && r <= pr) {
				leaf[x] = r-l;
				return -1;
			}
			if (l != 0 || x == 1) {
				id[x] = cnt++;
				vec.eb(); sp.eb();
			}
			else {
				id[x] = id[1];
			}
			int p = id[x];
			int mid = l+((r-l)>>1);
			{
				int q = work(ls,l,mid,pl,pr,vec,sp);
				if (p != q) {
					if (q != -1) {
						vec[p].eb(q,0);
					}
					else if (leaf[ls]) {
						sp[p].eb(leaf[ls],0);
					}
				}
			}
			{
				int q = work(rs,mid,r,pl,pr,vec,sp);
				if (p != q) {
					if (q != -1) {
						vec[p].eb(q,1);
					}
					else if (leaf[rs]) {
						sp[p].eb(leaf[rs],1);
					}
				}
			}
			return id[x];
		}
		auto work(int pl,int pr,V<V<pii>> &vec,V<V<pii>> &sp) {
			work(1,0,n,pl,pr,vec,sp);
		}
	};
	void main() {
		int l,r;
		cin >> l >> r; r++;
		auto clg = [&](int x) {
			int k = __lg(x);
			if (x != (1<<k)) {
				k++;
			}
			return k;
		};
		const int lg = clg(r),n = 1<<lg;
		Seg seg(n);
		V<V<pii>> vec,sp;
		seg.work(l,r,vec,sp);
		int cnt = seg.cnt,mx = 0;
		for (auto &p:sp) {
			for (auto &[x,_]:p) {
				x = __lg(x);
				mx = max(mx,x);
			}
		}
		vi chs(mx+1);
		for (int i = 0; i <= mx; i++) {
			chs[i] = cnt++; vec.eb();
		}
		for (int i = mx; i >= 1; i--) {
			for (int j = 0; j < 2; j++) {
				vec[chs[i]].eb(chs[i-1],j);
			}
		}
		for (int i = 0; i < sz(sp); i++) {
			for (auto [x,k]:sp[i]) {
				vec[i].eb(chs[x],k);
			}
		}
		cout << sz(vec) << '\n';
		for (auto p:vec) {
			cout << sz(p);
			for (auto [x,k]:p) {
				cout << ' ' << x+1 << ' ' << k;
			}
			cout << '\n';
		}
	}
}

int main() {
	freopen("test.in","r",stdin);
	freopen("test.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(20);

//	jhsy::init();

	int T = 1;
//	cin >> T;
	while (T--) {
		jhsy::main();
	}

	return 0;
}