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

vector<pair<int,int>> p[210];

int cnt=2;
void calc(int l,int r,int cur){
    if(l==r){
        if(l==1){
            p[2].push_back({cur,1});
            return;
        }
        p[cnt+1].push_back({cur,l&1});
        cnt++;
        calc(l>>1,l>>1,cnt);
        return;
    }
    if((l&1)==1){
        calc(l,l,cur);
        l++;
    }
    if((r&1)==0){
        calc(r,r,cnt);
        r--;
    }
    if(r>l){
        p[cnt+1].push_back({cur,1});
        p[cnt+1].push_back({cur,0});
        cnt++;
        calc(l>>1,r>>1,cnt);
    }
}

void solve(){
    ll l,r;cin>>l>>r;
    
    calc(l,r,1);

    cout<<cnt<<"\n";
    for(int i=1;i<=cnt;i++){
        cout<<p[i].size()<<" ";
        for(auto [j,w]:p[i]){
            cout<<j<<" "<<w<<" ";
        }
        cout<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n=1;
    //cin>>n;
    while(n--)solve();
    return 0;
}