#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

const int MAXN=200+5;
int L[MAXN],R[MAXN],L2[MAXN],R2[MAXN];
int lenl,lenr;
int l,r;
int tot;
vector<pair<int,int>>Edge[MAXN];
int ID[MAXN],ed;

int free(int len){
    if(ID[len]) return ID[len];
    ID[len]=++tot;
    if(len>0){
        int nxt=free(len-1);
        Edge[ID[len]].push_back(make_pair(nxt,0));
        Edge[ID[len]].push_back(make_pair(nxt,1));
    }
    return ID[len];
}

int dfs(int len, bool l, bool r){
    if(!l && !r){
        return free(len);
    }
    if(!len) return free(0);
    int res=++tot;
    if(!l || L[len]==0){
        int new_pos=dfs(len-1,l,r&&R[len]==0);
        Edge[res].push_back(make_pair(new_pos,0));
    }
    
    if(!r || R[len]==1){
        int new_pos=dfs(len-1,l&&L[len]==1,r);
        Edge[res].push_back(make_pair(new_pos,1));
    }
    
    return res;
}

void solve(){
    cin>>l>>r;
    while(l){
        L[++lenl]=l&1;
        R2[lenl]=1;
        l>>=1;
    }
    while(r){
        R[++lenr]=r&1;
        L2[lenr]=0;
        r>>=1;
    }
    L2[lenr]=1;
    if(lenl==lenr){
        dfs(lenl,1,1);
    }else{
        tot=1;
        // Edge[1].push_back(make_pair(pos,1));
        for(int i=lenr-2; i>lenl-1; i--){
            int new_pos=free(i);
            // Edge[pos].push_back(make_pair(new_pos,0));
            Edge[1].push_back(make_pair(new_pos,1));
        }
        swap(R2,R);
        Edge[1].push_back(make_pair(dfs(lenl-1,1,1),1));
        swap(R2,R);
        swap(L2,L);
        Edge[1].push_back(make_pair(dfs(lenr-1,1,1),1));
        swap(L2,L);
    }
    // cout<<"111\n";
    // for(int i=0; i<=lenl; i++) cout<<"ID["<<i<<"] = "<<ID[i]<<"\n";
    cout<<tot<<"\n";
    for(int i=1; i<=tot; i++){
        cout<<Edge[i].size();
        for(auto x:Edge[i]){
            cout<<" "<<x.first<<" "<<x.second;
        }
        cout<<"\n";
    }
}

int main(){
    // freopen("Input.txt","r",stdin);
    // freopen("Output.txt","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T=1;
    // cin>>T;
    while(T--) solve();
    return 0;
}