#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int N=1e6+5,K=20;
const ll MOD=998244353;
int L,R,S,T,n;
int ch[N][2];
vector<pii> op,ed[N];

void input()
{
    scanf("%d%d",&L,&R);
    S=1,T=2,n=2;
}

void workve()
{
    while(L+(L&-L)-1<=R) op.pb({L,log2(L&-L)}),L+=L&-L;
    for(int i=log2(L&-L);i>=0;i--) if(L+(1<<i)-1<=R) op.pb({L,i}),L+=(1<<i);
}

void ade(int x,int y,int w) {ed[x].pb({y,w});}

void build1()
{
    int mx=0;
    for(auto[x,y]:op) mx=max(mx,y);
    for(int i=1;i<=mx;i++)
    {
        int u=++n;
        ade(u,u-1,0),ade(u,u-1,1);
    }
}

bool in(int x,int i) {return (x>>i)&1;}

void build2()
{
    for(auto[x,y]:op)
    {
        int nw=1,k=log2(x);
        //cerr<<' '<<x<<' '<<y<<' '<<k<<endl;
        for(int i=k;i>y;i--)
        {
            int c=in(x,i);
            if(!ch[nw][c]) ch[nw][c]=++n,ade(nw,n,c);
            nw=ch[nw][c];
        }
        ade(nw,T+y,in(x,y));
    }
}

void solve()
{
    input();
    workve();
    build1();
    build2();
    printf("%d\n",n);
    for(int i=1;i<=n;i++)
    {
        printf("%d",ed[i].size());
        for(auto[x,y]:ed[i]) printf(" %d %d",x,y);
        printf("\n");
    }
}

int main()
{
    int T=1;
    for(int cs=1;cs<=T;cs++) solve();
}