#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(a,b,c) for(ll a=b;a<=(c);a++)
#define drep(a,b,c) for(ll a=b;a>=(c);a--)
#define io ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define dpq priority_queue<ll, vector<ll>, less<ll> > 
#define pq priority_queue<ll, vector<ll>, greater<ll> > //push pop
#define spq priority_queue<string>
#define pairqueue priority_queue<pair<ll,ll>>
#define mls multiset  //insert erase迭代器 extract具体元素
#define ull unsigned long long
#define PI 3.14159265358979323846
const ll inf =0x3f3f3f3f3f3f3f;
#define mod 1000000007
#define N 2000100
map<ll, map<ll,ll>>mp0; map<ll, map<ll, ll>>mp1;
map<ll ,map<ll,ll>>mp;//你清空map了吗？
ll a[N],b[N];
ll mi[N];
void solve()
{
    ll l,r;
    cin>>l>>r;
    mi[0]=1;
    rep(i,1,21)
    {
        mi[i]=mi[i-1]*2;
    }
    ll maxn=0;
    ll lenth=r-l+1;
    ll left=l,right=r;
    while(lenth!=0)
    {
        drep(i,21,0)
        {
            if(lenth>=mi[i]&&(right+1)%mi[i]==0)
            {
                maxn=max(maxn,i);
                lenth-=mi[i];
                right=right-mi[i];
                break;
            }
        }
    }
    maxn++;
    ll tot=maxn+1;
    //cerr<<tot<<"\n";
    rep(i,2,maxn)
    {
        mp0[i][i-1]=1;
        mp1[i][i-1]=1;
    }
    lenth=r-l+1;
    left=l,right=r;
    while(lenth!=0)
    {
        drep(i,21,0)
        {
            if(lenth>=mi[i]&&(right+1)%mi[i]==0)
            {
                //cerr<<mi[i]<<"\n";
                ll temp=right/mi[i];
                //cerr<<temp<<"\n";
                stack<ll>q;
                while(temp)
                {
                    q.push(temp%2);
                    temp/=2;
                }
                if(!q.empty())
                {
                    ll last=0;
                    while(q.size()>1)
                    {
                        ll num=q.top();
                        q.pop();
                        if(mp[last].count(num))
                        {
                            last=mp[last][num];
                        }
                        else
                        {
                            if(num==1)
                            {
                                mp1[last][tot]=1;
                            }
                            else mp0[last][tot]=1;
                            //cerr<<last<<" "<<tot<<"\n";
                            mp[last][num]=tot;
                            last=tot;
                            tot++;
                        }
                    }
                    ll num=q.top();
                    q.pop();
                    if(num==1)
                    {
                        mp1[last][i+1]=1;
                    }
                    else mp0[last][i+1]=1;
                    //tot++;
                }
                else
                {
                    mp1[0][i+1]=1;
                    mp0[0][i+1]=1;
                }
                lenth-=mi[i];
                right=right-mi[i];
                break;
            }
        }
        //cerr<<lenth<<" "<<tot<<"\n";
    }
    cout<<tot<<"\n";
    rep(i,0,tot-1)
    {
        ll ans=0;
        for(auto b:mp0[i])
        {
            ans++;
        }
        for(auto b:mp1[i])
        {
            ans++;
        }
        cout<<ans<<" ";
        for(auto b:mp0[i])
        {
            cout<<b.first+1<<" "<<0<<" ";
        }
        for(auto b:mp1[i])
        {
            cout<<b.first+1<<" "<<1<<" ";
        }
        cout<<"\n";
    }
}
int main()
{
    io;
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}