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

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

int cnt=2;
int calc(int l,int r){
    if(l==r){
        if(l==0)return 1;
        if(l==1)return 2;
        if(mp.find(l)!=mp.end())return mp[l];
        int t=calc(l>>1,l>>1);
        p[t].push_back({cnt+1,l&1});
        cnt++;
        return mp[l]=cnt;
    }
    vector<pair<int,int>> v;
    if((l&1)==1){
        int t=calc(l>>1,l>>1);
        v.push_back({t,1});
        l++;
    }
    if((r&1)==0){
        int t=calc(r>>1,r>>1);
        v.push_back({t,0});
        r--;
    }
    if(r>l){
        int t=calc(l>>1,r>>1);
        v.push_back({t,0});
        v.push_back({t,1});
    }
    for(auto [i,j]:v){
        p[i].push_back({cnt+1,j});
    }
    cnt+=1;
    return cnt;
}

void solve(){
    int l,r;cin>>l>>r;
    
    calc(l,r);
    p[1].push_back({2,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;
}