#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair <int , int>
#define fi first
#define se second
#define pb emplace_back

const int N = 105;

map <int , map <int , int> > mp;
int l , r , n = 1;

vector <pii> G[N];

int solve (int l , int r) {
	if (mp[l][r]) return mp[l][r];
	mp[l][r] = ++ n; int tmp = n;
	if (l + r == 0) return n;
	if (l == 1) G[1].pb ((pii) {n , 1}) , l ++;	
	int l0 = (l % 2 == 0 ? l / 2 : (l + 1) / 2);
	int r0 = (r % 2 == 0 ? r / 2 : (r - 1) / 2);
	int l1 = (l % 2 == 1 ? l / 2 : (l + 1) / 2);
	int r1 = (r % 2 == 1 ? r / 2 : (r - 1) / 2);
	if (l0 <= r0) {
		int id = solve (l0 , r0);
		G[id].pb ((pii) {tmp , 0});
	} if (l1 <= r1) {
		int id = solve (l1 , r1);
		G[id].pb ((pii) {tmp , 1});
	}
	return tmp;
}

signed main () {
	cin >> l >> r; mp[0][0] = 1; solve (l , r);
	cout << n << '\n';
	for (int i = 1;i <= n;i ++) {
		cout << G[i].size() << ' ';
		for (pii x : G[i]) cout << x.fi << ' ' << x.se << ' ';
		cout << '\n';
	}
	return 0;
}