#include<bits/stdc++.h>
using namespace std;
int L,R,W,S,T,num;
struct edge{int to,tw;};
vector<vector<edge> >E(1);
int New(){
    E.push_back({});
    return ++num;
}
void ejoin(int x,int y,int z){
    E[x].push_back(edge{y,z});
}
int Web[50];
void buildWeb(){
    Web[0]=New();
    ejoin(Web[0],T,0);
    ejoin(Web[0],T,1);
    for(int i=1;i<W;i++){
        Web[i]=New();
        ejoin(Web[i],Web[i-1],0);
        ejoin(Web[i],Web[i-1],1);
    }
}
void build(int u,int p,bool ctL,bool ctR){
    if(p<0)return;
    if(!ctL&&!ctR){
        if(!p){
            ejoin(u,T,0);
            ejoin(u,T,1);
        }else{
            ejoin(u,Web[p-1],0);
            ejoin(u,Web[p-1],1);
        }
        return ;
    }
    if(ctL&&ctR){
        if(((R>>p)&1)^((L>>p)&1)){
            int t=p?New():T;
            ejoin(u,t,0);
            build(t,p-1,1,0);
            t=p?New():T;
            ejoin(u,t,1);
            build(t,p-1,0,1);
        }else{
            int t=p?New():T;
            ejoin(u,t,((R>>p)&1));
            build(t,p-1,1,1);
        }
        return;
    }
    if(ctL){
        int bt=(L>>p)&1;
        if(bt){
            int t=p?New():T;
            ejoin(u,t,1);
            build(t,p-1,1,0);
        }else{
            int t=0;
            if(u==S){
                build(S,p-1,1,0);
            }else{
                t=p?New():T;
                ejoin(u,t,0);
                build(t,p-1,1,0);
            }
            t=p?New():T;
            ejoin(u,t,1);
            build(t,p-1,0,0);
        }
    }else{
        int bt=(R>>p)&1;
        if(!bt){
            int t=p?New():T;
            ejoin(u,t,0);
            build(t,p-1,0,1);
        }else{
            int t=p?New():T;
            ejoin(u,t,0);
            build(t,p-1,0,0);
            t=p?New():T;
            ejoin(u,t,1);
            build(t,p-1,0,1);
        }
    }
}
int n,topu[100005];
int atn[100005];
int ino[100005];
vector<vector<edge> >aE;
void deldfs(int u){
	for(auto e:E[u]){
		--ino[e.to];
		if(!ino[e.to])
		deldfs(e.to);
	}
}
void topuOrd(){
    for(int i=1;i<=num;i++)
    for(auto e:E[i])++ino[e.to];
    for(int i=3;i<=num;i++){
    	if(!ino[i])deldfs(i);
	}
    static int que[100005],hd,tl;
    que[hd=tl=1]=S;
    while(hd<=tl){
        int u=que[hd++];topu[++n]=u;
        for(auto e:E[u]){
            --ino[e.to];
            if(!ino[e.to]){
                que[++tl]=e.to;
            }
        }
    }
    for(int i=1;i<=n;i++)
    atn[topu[i]]=i;
    aE=vector<vector<edge> >(n+1,vector<edge>{});
    for(int i=1;i<=n;i++){
        int u=topu[i];
        for(auto e:E[u]){
            aE[i].push_back(edge{atn[e.to],e.tw});
        }
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin>>L>>R;
    if(R==1){
        cout<<"2\n";
        cout<<"1 2 1\n";
        cout<<"0\n";
        return 0;
    }
    S=New();T=New();
    while((1ll<<(W+1))<=R)++W;
    buildWeb();
    if(((R>>W)&1)^((L>>W)&1)){
        build(S,W-1,1,0);
        int t=New();
        ejoin(S,t,1);
        build(t,W-1,0,1);
    }else{
        int t=New();
        ejoin(S,t,((R>>W)&1));
        build(t,W-1,1,1);
    }
    topuOrd();
    cout<<n<<'\n';
    for(int i=1;i<=n;i++){
        cout<<aE[i].size()<<' ';
        for(auto e:aE[i]){
            cout<<e.to<<' '<<e.tw<<' ';
        }
        cout<<'\n';
    }
    return 0;
}