#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)(a.size())
typedef long long int ll;
vector<array<int,2>>adj[101],g[101];
int lab[101],deg[101];
int cc = 0;
int vis[1000001];
vector<int>app;
int l,r;
void dfs(int v,int cur){
    if(g[v].empty()){
        vis[cur]++;
        if(vis[cur] > 1)app.push_back(cur);
        assert(cur >=l  && cur <= r);
        assert(vis[cur] == 1);
        cc++;
    }
    for(auto [x,c]:g[v]){
        dfs(x,2*cur+c);
    }
}
int main()
{
   //freopen("output","w",stdout);
    cin>>l>>r;
    int st = 2;
    int cnt = 2;
    int f = -1;
    for(int i=21;i>=0;i--){
        if((r&(1<<i)) != (l&(1<<i))){
            f = i;
            break;
        }
    }
    bool over = 0;
    int cur = st;
    for(int j=21;j>=0;j--){
        int cl = (l&(1<<j)) > 0;
        if(cl)over = 1;
        if(over)adj[cur].push_back({++cnt,cl});
        if(f > j && !cl)adj[cur].push_back({100-j,1});

        if(over)cur = cnt;
    }
    if(l != r){
        bool over = 0;
        int cur = st;
        for(int j=21;j>=0;j--){
            int cr = (r&(1<<j)) > 0;
            if(cr)over = 1;
            if(over)adj[cur].push_back({++cnt,cr});
            if(f > j && cr)adj[cur].push_back({100-j,0});

            if(over)cur = cnt;
        }
            
    }
    //cout<<cnt<<" ";
    int mx = -1;
    for(int v=1;v<=cnt;v++){
        for(auto &[x,c]:adj[v]){
            if(x > 75)mx = max(mx,100-x);
        }
    }
    //cout<<cnt<<" "<<mx<<'\n';
    for(int i=0;i<=mx;i++){
        lab[i] = ++cnt;
    }
    for(int i=0;i<mx;i++){
        adj[lab[i+1]].push_back({lab[i],0});
        adj[lab[i+1]].push_back({lab[i],1});
    }
    for(int v=1;v<=cnt;v++){
        for(auto &[x,c]:adj[v]){
            if(x > 75)x = lab[100-x];
        }
    }
    for(int v=1;v<=cnt;v++){
         for(auto &[x,c]:adj[v]){
            if(sz(adj[x]) == 0)x = 1;
        }
    }
    vector<int>d(cnt+1,0);
    for(int v=1;v<=cnt;v++){
         for(auto &[x,c]:adj[v]){
            d[v]++;
            d[x]++;
        }
    }
    vector<int>crd;
    for(int i=1;i<=cnt;i++){
        if(!d[i])continue;
        crd.push_back(i);
    }
    

    cout<<sz(crd)<<'\n';
    for(int i=0;i<sz(crd);i++){
        cout<<sz(adj[crd[i]]);
        for(auto &[x,y]:adj[crd[i]]){
            int a = lower_bound(crd.begin(),crd.end(),x) - crd.begin()+1;
            g[i+1].push_back({a,y});
            cout<<" "<<a<<" "<<y;

        }
        cout<<'\n';
    }
    dfs(2,0);
   // cout<<'\n';
    //cout<<cc<<'\n';
    //cout<<sz(app)<<'\n';
    //for(int x:app)cout<<x<<'\n';


}
//11110100001001000000