#include<bits/stdc++.h>

#define ll long long 
#define pb push_back
#define ff first
#define ss second
#define ld long double

using namespace std;

vector<pair<int, int> > adj[500];
int currentNode = 1;

int easyPath[50];

void addEdje(int u, int v, int value){
    if(v == -1)return ;
    adj[u].pb({v, value});
}

int calc_easy_path(int pot){
    //cout << "calc easy " << pot << endl;
    if(pot == 0)return 200;
    if(easyPath[pot] != -1){
        return easyPath[pot];
    }
    
    easyPath[pot] = currentNode ++ ;
    addEdje(easyPath[pot], calc_easy_path(pot-1), 1);
    addEdje(easyPath[pot], calc_easy_path(pot-1), 0);
    return easyPath[pot];
}


int solve(int l, int r, int currentBit){
    //cout << "solving " << l << " " << r << endl;

    if(l > r)return -1;
    if(currentBit == -1){
        return 200;
    }

    if(l == 0 && (r == (1 << (currentBit + 1) ) - 1)){
        return calc_easy_path(currentBit + 1);
    }

    int on = (1 << currentBit);
    int u = currentNode ++ ;
    int resultNode = solve(max(0, l - on), r - on, currentBit - 1);

    if(resultNode != -1){
        addEdje(u, resultNode, 1);
    }

    resultNode = solve(l, min(r, on - 1), currentBit - 1);
    if(resultNode != -1){
        addEdje(u, resultNode, 0);
    }

    return u;
}



int try_solve(int l, int r){
    vector<int>insides;

    for(int on_bit = 0 ; on_bit < 30 ; on_bit ++ ){
        int curPot = (1 << on_bit);
        if(curPot >= l && curPot <= r){
            insides.pb(on_bit);
        }
    }

    int inicio = currentNode ++ ;

    if(insides.empty()){
        for(int bit = 29 ; bit >= 0 ; bit --){
            int on = (1 << bit);
            if((on & l) && (on & r)){
                addEdje(inicio, solve(l - on, r - on, bit - 1), 1);
                return inicio;
            }
        }
        return inicio;
    }

    addEdje(inicio, solve(0, r - (1 << insides.back()), insides.back() - 1), 1);
    int bitt = (insides[0] - 1); // What if insides[0] == 0?
    if(bitt != -1){
        addEdje(inicio, solve(l - (1 << bitt), (1 << insides[0] ) - 1 - (1 << bitt), bitt - 1), 1);
    }

    for(int i = 0 ; i < (int)insides.size() - 1 ; ++ i){
        int from = (1 << insides[i]) - (1 << insides[i]); // 10000 -> 00000, 
        int upto = (1 << insides[i+1]) - 1 - (1 << insides[i]);
        addEdje(inicio, solve(from, upto, insides[i] - 1), 1);
    }



    return inicio;
}


int main(){
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);

    int l, r;
    cin >> l >> r;


    memset(easyPath, -1, sizeof easyPath);
    
    try_solve(l, r);

    cout << currentNode << "\n";
    for(int i = 1 ; i <= currentNode ; i ++){
        cout << adj[i].size() << " ";
        for(int j = 0 ; j < adj[i].size() ; j  ++){
            if(adj[i][j].ff == 200)adj[i][j].ff = currentNode;
            cout << adj[i][j].ff << " " << adj[i][j].ss << " ";
        }
        cout << "\n";
    }

}