#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long 
#define maxn 100005
  
int n, m, tot;
vector<int> bits;
vector<pair<int, int>> ans[maxn];
int L, R;
int cal(int l, int r) {
	if (L <= l && r <= R) {
		int len = r - l;
		int i = 0;
		for (; (1ll << i) < len; ++i) {
			if (i + 1 == bits.size()) {
				++tot;
				ans[tot].push_back({ bits.back(), 0 });
				ans[tot].push_back({ bits.back(), 1 });
				bits.push_back(tot);
			}
		}
		return bits[i];
	}

	int id = ++tot;
	int mid = (l + r) >> 1;
	if (L < mid) {
		ans[id].push_back({ cal(l, mid), 0 });
	}
	if (R > mid) {
		ans[id].push_back({ cal(mid, r), 1 });
	}
	return id;
}
void solve() {
	
	cin >> L >> R;
	R ++;
	tot = 2;
	bits.push_back(2);
	for (int i = 0; (1ll << i) < R; ++i) {
		int l = 1ll << i, r = 1ll << (i + 1);
		if (L >= r) continue;
		int id = cal(1ll << i, 1ll << (i + 1));
		ans[1].push_back({id, 1});
	}
	
	cout << tot << endl;
	for (int i = 1; i <= tot; ++i) {
		cout << ans[i].size()<<" ";
		for (auto p : ans[i]) {
			cout << p.first << " " << p.second << " ";
		}
		cout << endl;
	}

}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1;
	//cin >> T;
	while (T--) {
		solve();
	}
}