#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
#define mem(a,x,n) memset(a,x,sizeof(*a)*((n)+2))
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }

const int N = 105;
int n,s,t,L,R,m=-1,f[25];
vector<Pii> e[N];

int g(int i) {
	while( m < i ) {
		f[++m] = ++n;
		if( !m ) e[f[0]].pb(t,0), e[f[0]].pb(t,1);
		else e[f[m]].pb(f[m-1],0), e[f[m]].pb(f[m-1],1);
			
	}
	return f[i];
}

void dfs(int u,int i,bool liml,bool limr) {
	if( i < 0 ) return;
	int l = liml ? L>>i&1 : 0, r = limr ? R>>i&1 : 1;
	if( !i ) {
		For(x,l,r) e[u].pb(t,x);
		return;
	}
	if( !liml && !limr ) {
		e[u].pb(g(i-1),0), e[u].pb(g(i-1),1);
		return;
	}
	For(x,l,r) e[u].pb(++n,x), dfs(n,i-1,liml&&x==l,limr&&x==r);
}

void MAIN() {
	cin>>L>>R;
	if( R == 1 ) { cout<<"2\n1 2 1\n0\n"; return; }
	s = ++n, s = ++n, t = ++n, e[s-1].pb(s,1);
	if( L == 1 ) e[1].pb(t,1), L = 2;
	int l = 31-__builtin_clz(L), r = 31-__builtin_clz(R);
	if( l == r ) dfs(s,l-1,1,1);
	else {
		dfs(s,l-1,1,0), dfs(s,r-1,0,1);
		Rep(i,l+1,r) e[s].pb(g(i-2),0), e[s].pb(g(i-2),1);
	}
	cout<<n<<'\n';
	For(i,1,n) {
		cout<<sz(e[i])<<" ";
		for(auto [j,k] : e[i]) cout<<j<<" "<<k<<" ";
		cout<<'\n';
	}
} signed main() {
#ifdef FS
	freopen("in","r",stdin); freopen("out","w",stdout);
#endif
	ios::sync_with_stdio(0);cin.tie(0);
	int lft=1; while( lft-- ) {
		MAIN();
	}
	return 0;
}
/*
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
#define mkp make_pair
#define mem(a,x,n) memset(a,x,sizeof(a[0])*(n+2))
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }

const int mod = 998244353;
struct mint {
    int x; mint(int x=0):x(x<0?x+mod:x<mod?x:x-mod){}
    mint(LL y) { y%=mod, x=y<0?y+mod:y; }
    mint& operator += (const mint &y) { x=x+y.x<mod?x+y.x:x+y.x-mod; return *this; }
    mint& operator -= (const mint &y) { x=x<y.x?x-y.x+mod:x-y.x; return *this; }
    mint& operator *= (const mint &y) { x=1ll*x*y.x%mod; return *this; }
    friend mint operator + (mint x,const mint &y) { return x+=y; }
    friend mint operator - (mint x,const mint &y) { return x-=y; }
    friend mint operator * (mint x,const mint &y) { return x*=y; }
};	mint Pow(mint x,LL y=mod-2) { mint z(1);for(;y;y>>=1,x*=x)if(y&1)z*=x;return z; }

const int N = 205;
int n,L,R,s,t,deg[N];
vector<Pii> e[N];
multiset<int> st;

void dfs(int u,int x) {
    // cerr<<u<<" "<<x<<'\n';
    if( u == t ) { st.emplace(x); return; }
    for(auto [v,w] : e[u]) dfs(v,x<<1|w);
}

void MAIN() {
    ifstream fin("in");
    ifstream fout("out");
    fin>>L>>R;
    fout>>n;
    For(i,1,n, m) {
        fout>>m;
        e[i].resize(m);
        for(auto &[j,k] : e[i]) fout>>j>>k, ++deg[j];
        if( e[i].empty() ) assert(!t), t = i;
    }
    For(i,1,n) if( !deg[i] ) assert(!s), s = i;
    dfs(s,0);
    assert(sz(st)==R-L+1);
    For(i,L,R) assert(st.count(i));
} signed main() {
    ios::sync_with_stdio(0);cin.tie(0);
    int lft=1; while( lft-- ) {
        MAIN();
    }
    return 0;
}
*/