#include <bits/stdc++.h>
#define int long long
using namespace std;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using i64 = long long;
using pi = pair<int,int>;
#define mem(a, b) memset((a), (b), sizeof(a))
#define all(a) (a).begin(), (a).end()
#define lowbit(x) (-x)&x
#define ls u<<1
#define rs u<<1|1
mt19937 rnd(time(0));

const i64 mod = 998244353;
const i64 N = 1e3+7;
const i64 inf = 1e18+7;

i64 qmi(i64 m, i128 k,i64 p = mod){i128 res = 1, t = m;while (k){if (k & 1) res = (res * t) % p;t = t * t % p;k >>= 1;}return res;}
i64 inv(i64 u){return qmi(u,mod-2);}
void solve()
{   
    int n = 1;
    vector<array<int,2>> G(101);
    vector g(101,vector<vector<int>>(2));
    int l,r;cin>>l>>r;
    int nowl = l, nowr = r;
    auto lowbi = [](int x){
        return lowbit(x);
    };
    vector<array<int,2>> res,res2;
    while(1)
    {
        int nx = nowl - 1 + lowbi(nowl);
        if(nx>r)    break;
        res.push_back({nowl,nx});
        nowl = nx+1;
    }
    while(1)
    {
        int nx = nowr - lowbi(nowr);
        if(nx==0 || nx<nowl)    break;
        res2.push_back({nx,nowr-1});
        nowr -= lowbi(nowr);
    }
    if(nowl<=r)   res.push_back({r,r});
    reverse(all(res2));
    for(auto c:res2)
        res.push_back(c);
    // for(auto [c,d]:res)
    //     cout<<"$"<<c<<" "<<d<<"\n";
    vector<array<int,3>> ne;
    int maxne = 0;
    auto link = [&](int st, int final,int dest){
        string rt = bitset<21>(st).to_string();
        reverse(all(rt));
        while(rt.back()=='0')   rt.pop_back();
        reverse(all(rt));
        
        int sta = 1;
        for(auto c:rt)
        {
            if(!G[sta][c-'0'])
                G[sta][c-'0'] = ++n;
            sta = G[sta][c-'0'];
        }
        ne.push_back({sta,final,dest});
        // G[sta][final] = dest;
        maxne = max(dest,maxne);
    };
    // for(int i=2;i<=20;i++)
    //     G[i][0] = G[i][1] = i-1;
    for(auto [c,d]:res)
    {
        int p = d-c;
        int dest = 1;
        while(p)    dest++,p>>=1;
        link(c>>dest, (c>>(dest-1))&1, dest);
    }
    cout<<n+maxne<<"\n";
    for(int i=n+2;i<=maxne+n;i++)
        G[i][1] = G[i][0] = i-1;
    for(auto [c,d,e]:ne)    
        g[c][d].push_back(e+n);
    for(int i=1;i<=n+maxne;i++)
    {
        vector<array<int,2>> pp;
        for(int j=0;j<2;j++)
        {
            if(G[i][j])
                pp.push_back({G[i][j],j});
            for(auto c:g[i][j])
                pp.push_back({c,j});
        }
        cout<<pp.size();

        for(auto [c,d]:pp)  cout<<" "<<c<<" "<<d;
        cout<<"\n";
    }
    
}
signed main()
{   
    // freopen("test.in","r",stdin);
    // freopen("test.out","w",stdout);
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);int T = 1;
    // cin>>T;      
    while(T--) solve();
}