#include<bits/stdc++.h>
using namespace std;

vector<pair<int,int> >g[200];//从0开始
int cnt=21;
int maxx;

void print()
{
    // cout<<cnt<<endl;
    // cout<<maxx<<endl;
    int tot=cnt-(21-maxx);
    cout<<tot+1<<endl;
    for(int i=0;i<=cnt;i++)
    {
        
        if(i>maxx && i<=21)continue;
        cout<<g[i].size()<<" ";
        for(auto [p,e]:g[i])
        {
            if(p>21)p=maxx+p-21;
            cout<<p+1<<" "<<e<<" ";
        }
        cout<<endl;
    }
}

int main()
{
    int l,r;
    int ll,rr;
    cin>>l>>r;
    ll=l,rr=r;
    if(l==r)
    {
        vector<int>bi;
        while(l)
        {
            bi.push_back(l&1);
            l>>=1;
        }
        reverse(bi.begin(),bi.end());
        cout<<bi.size()+1<<endl;
        for(int i=1;i<=bi.size();i++)
        {
            cout<<1<<" "<<i+1<<" "<<bi[i-1]<<endl;
        }
        cout<<0;
        return 0;
    }

    vector<int>b1,b2;
    while(l)
    {
        b1.push_back(l&1);
        l>>=1;
    }
    while(r)
    {
        b2.push_back(r&1);
        r>>=1;
    }

    reverse(b1.begin(),b1.end());
    reverse(b2.begin(),b2.end());

    // for(int i=0;i<b1.size();i++)cout<<b1[i];cout<<endl;
    // for(int i=0;i<b2.size();i++)cout<<b2[i];cout<<endl;

    bool flag=0;
    
    for(int i=1;i<=20;i++)g[i+1].push_back({i,1}),g[i+1].push_back({i,0});

    int x=0;
    for(int i=1;i<=b1.size();i++)
    {
        int bit=b1[i-1];
        // cout<<"bit="<<bit<<" "<<cnt<<endl;

        if(b1.size()==1)
        {
            g[0].push_back({1,1});
            break;
        }
        if(i==1)
        {
            x+=( 1<<(b1.size()-i) );
            g[0].push_back({++cnt,1});
            continue;
        }

        bool lst=0;
        if(i==b1.size())g[cnt].push_back({1,bit}),lst=1;
        
        else g[cnt].push_back({cnt+1,bit}),cnt++;

        if(bit)x+=( 1<<(b1.size()-i) );


        if(!bit)
        {
            if( x + (1<<(b1.size()-i+1)) - 1 == rr)
            {
                // cout<<cnt-1<<" "<<bit<<endl;
                // cout<<6666;
                flag=1;
                if(!lst)g[cnt-1].push_back({b1.size()-i+1,1});
                else g[cnt].push_back({b1.size()-i+1,1});
                maxx=max(maxx,int(b1.size()-i+1));
            }
            else if( x + (1<<(b1.size()-i+1)) - 1 < rr )
            {
                // cout<<cnt-1<<" "<<bit<<endl;
                // cout<<666<<" "<<x + (1<<(b1.size()-i+1) - 1
                if(!lst)g[cnt-1].push_back({b1.size()-i+1,1});
                else g[cnt].push_back({b1.size()-i+1,1});
                maxx=max(maxx,int(b1.size()-i+1));
            }
            else
            {
                continue;
            }
        }
    
    }

    if(flag)
    {

        print();
        return 0;
    }

    int ff=1;
    if(b1.size()!=b2.size())ff=1;
    else for(int i=0;i<b2.size();i++)
    {
        if(b1[i]==b2[i])ff++;
        else break;
    }
    // cout<<"ff="<<ff<<endl;

    int tot=b1.size()+1;
    x=(1 << tot )-1;
    
    while(x<rr)
    {
        g[0].push_back({tot,1});
        maxx=max(maxx,tot);
        tot++;
        x=(1 << tot)-1;
    }
    if(x==rr)
    {
        g[0].push_back({tot,1});
        maxx=max(maxx,tot);
        print();
        return 0;
    }

    // cout<<"ff="<<ff<<endl;

    for(int i=1;i<=b2.size();i++)
    {
        ff--;
        if(b2.size()==1)
        {
            g[0].push_back({1,1});
            break;
        }
        int bit=b2[i-1];
        if(i==1)
        {
            g[0].push_back({++cnt,1});
            continue;
        }

        bool lst=0;
        if(i==b2.size())g[cnt].push_back({1,bit}),lst=1;

        

        else g[cnt].push_back({cnt+1,bit}),cnt++;

        if(bit)
        {
            if(ff>=0)continue;
            // cout<<cnt-1<<" "<<bit<<endl;
            if(!lst)g[cnt-1].push_back({b2.size()-i+1,0});
            else g[cnt].push_back({b2.size()-i+1,0});
            maxx=max(maxx,int(b2.size()-i+1));
        }
    }
    print();
    return 0;
}