#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
struct node{
    int v,dat;
    node(){}
    node(int V,int D){v=V;dat=D;}
    friend bool operator == (const node&a,const node&b){
        return a.v==b.v&&b.dat==a.dat;
    }
    friend bool operator <(const node&a,const node &b){
        if(a.v==b.v)return a.dat<b.dat;
        return a.v<b.v;
    }
};vector<node> g[N];
int tot=2,Ed=2;
int bitcount(int a){
    int siz=0;while(a){
        a>>=1;siz++;
    }return siz;
}
vector<int> lnk;int flg=0;
void diverses(int a,int b,int m,int p){
    //cout<<a<<' '<<b<<endl;
    if(a==2&&b==3){
        g[p].push_back(node(lnk[flg-m],1));return;
    }
    if((a==(1<<m-1))&&(b==(1<<m)-1)){
        //cout<<"yes";

        g[p].push_back(node(lnk[flg-m],1));
        return;
    }
    if(a==b){
        int x=!!(a&(1<<m-1));++tot;
        g[p].push_back(node(tot,x));
        p=tot;
        for(int i=m-2;i>0;i--){
            x=!!(a&(1<<i));++tot;
            g[p].push_back(node(tot,x));
            p=tot;
        }
        g[p].push_back(node(Ed,a&1));
        return;
    }
    int n=bitcount(a^b);
    for(int i=m;i>n;i--){
        ++tot;
        if(a&(1<<i-1))g[p].push_back(node(tot,1));
        else g[p].push_back(node(tot,0));
        p=tot;
    }

    int fa=p,fb=p;
    for(int i=n;i>0;i--){
        int x=!!(a&(1<<i-1)),y=!!(b&(1<<i-1));int nfa,nfb;
        if(i!=1){
        ++tot;g[fa].push_back(node(tot,x));nfa=tot;
        ++tot;g[fb].push_back(node(tot,y));nfb=tot;
        }else{
            g[fa].push_back(node(Ed,x));
            g[fb].push_back(node(Ed,y));
        }
        //if(flg-i>=lnk.size())printf("Danger!");
        if(fa!=p&&x==0)g[fa].push_back(node(lnk[flg-i],1));
        if(fb!=p&&y==1)g[fb].push_back(node(lnk[flg-i],0));
        fa=nfa;fb=nfb;
    }
}
int vis[N],nt;
vector<node> e[N];
void dfs(int p){
    if(vis[p])return;vis[p]=++nt;
    for(int i=0;i<g[p].size();i++){
        int v=g[p][i].v;
        //cout<<p<<" "<<v<<" "<<g[p][i].dat<<endl;
        dfs(v);
        e[vis[p]].push_back(node(vis[v],g[p][i].dat));
    }
}
int main(){
    int L,R;cin>>L>>R;
    int st=bitcount(L)-1,ed=bitcount(R);
    int mx=tot;
    int ii=bitcount(R);
    flg=ii;
    for(int j=ii;j>2;j--){
        tot++;
        lnk.push_back(tot);
        g[tot].push_back(node(tot+1,0));
        g[tot].push_back(node(tot+1,1));
    }
    if(ii>1){
        tot++;
        lnk.push_back(tot);
        g[tot].push_back(node(Ed,0));
        g[tot].push_back(node(Ed,1));
    }lnk.push_back(Ed);
    //for(int i=0;i<lnk.size();i++)cout<<lnk[i]<<',';cout<<endl;

    lnk.push_back(Ed);
    //cout<<"lnk_finish\n";
    for(int i=st;i<ed;i++){
        diverses(max(L,1<<i),min(R,(1<<i+1)-1),i+1,1);
        mx=max(mx,tot);
    }
    //cout<<"diversed\n";
    //cout<<tot<<endl;
    dfs(1);//return 0;
    cout<<nt<<endl;
    for(int i=1;i<=nt;i++){sort(e[i].begin(),e[i].end());e[i].erase(unique(e[i].begin(),e[i].end()),e[i].end());}
    for(int i=1;i<=nt;i++){
        printf("%d ",e[i].size());
        for(int j=0;j<e[i].size();j++)
        {
            int v=e[i][j].v;
            printf("%d %d ",v,e[i][j].dat);
        }
        printf("\n");
    }
    printf("\n");

    return 0;
}