#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;

mt19937 rng(time(NULL));

const int N=101;
vector<vector<pair<int,int>>> graf(N);
int trc;
int gt(){
	return trc++;
}
int mxp=1,gde=2;
map<int,int> pwc;
int gtp(int r){
	while(mxp-1<r){
		int sl=gt();
		graf[sl].pb({gde,1});
		graf[sl].pb({gde,0});
		mxp*=2;
		gde=sl;
		pwc[mxp-1]=gde;
	}
	assert(pwc[r]!=0);
	return pwc[r];
}
map<int,int> pws;
vector<int> firsts;
int solve(int l,int r,int bt,bool first){
	//printf("%i %i %i %i\n",l,r,bt,first);
	if(bt>r){
		if(first)
			return solve(l,r,bt/2,first);
		else{
			int my=gt();
			int sl=solve(l,r,bt/2,first);
			graf[my].pb({sl,0});
			return my;
		}
	}
	if(l==0&&pws[r]){ // endcase
		assert(!first);
		return gtp(r);
	}
	//printf("%i %i %i\n",l,r,bt);
	if(bt<=l){
		if(first){
			int sl=solve(l-bt,r-bt,bt/2,0);
			firsts.pb(sl);
			return 1;
		}
		int my=gt();
		int sl=solve(l-bt,r-bt,bt/2,0);
		graf[my].pb({sl,1});
		return my;
	}
	if(first){
		int lft=solve(l,bt-1,bt/2,1);
		assert(lft==1);
		int rght=solve(0,r-bt,bt/2,0);
		firsts.pb(rght);
		return 1;
	}
	int my=gt();
	int lft=solve(l,bt-1,bt/2,0);
	int rght=solve(0,r-bt,bt/2,0);
	graf[my].pb({lft,0});
	graf[my].pb({rght,1});
	return my;
}
int main()
{
	int l,r;
	cin >> l >> r;
	int en=2;
	pwc[0]=en;
	trc=en+1;
	for(int i=0;i<21;i++){
		pws[(1<<i)-1]=1;
	}
	int bt=1<<20;
	assert(solve(l,r,bt,1)==1);
	for(auto p:firsts){
		graf[1].pb({p,1});
	}
	printf("%i\n",trc-1);
	for(int i=1;i<trc;i++){
		printf("%i",sz(graf[i]));
		for(auto p:graf[i]){
			printf(" %i %i",p.f,p.s);
		}
		printf("\n");
	}
	return 0;
}