#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <time.h>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>

using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>

using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// to erase in multiset-> less_equal<T> and 
// s.erase(s.find_by_order(s.order_of_key(x)))
// lower_bound(x)=>(cannot use the stl lower_bound function)
// ll idx = s.order_of_key(x)
// if(idx == s.size()) -> no lower_bound
// else lb = *s.find_by_order(idx) // as 0-indexing
// idx-1 will give highest value which is strictly less than x
// for upper_bound->do the same with (x+1)

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef tuple<ll, ll, ll> t64;
typedef vector<t64> vt64;
typedef vector<vt64> vvt64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
typedef vector<vector<p32> > vvp32;
typedef vector<bool> vb;
ll mod =  1e9+7, MOD = 998244353;
double eps = 1e-12;
#define FOR(s, e, i) for(ll i = s; i <= e; i++)
#define ROF(s ,e, i) for(ll i = s; i >= e; i--)
#define F0R(i, e) for(ll i = 0; i < (e); i++)
#define trav(e, a) for(auto &e : a)
#define coutAll(A) for(auto asdafas : A) cout <<  asdafas << " "; cout << "\n";
#define foutAll(A) for(auto asdafas : A) fout <<  asdafas << " "; cout << "\n";
#define cinAll(A) for(auto &asdafas : A) cin >>  asdafas;
#define finAll(A) for(auto &asdafas : A) fin >>  asdafas;
#define minpq priority_queue<ll, v64, greater<ll>>
#define maxpq priority_queue<ll> 
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
ll inf = LLONG_MAX;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define yes cout<<"yes\n"
#define no cout<<"no\n"
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef pair<ll, ll> pii;
#define MAXN 100005

void solve(int it)
{
    int l, r;
    cin >> l >> r;
    // 1 er start, 2 e end
    // template path
    vvp32 adj(MAXN);
    FOR(3, 20, i){
        // 2 er shathe
        // adj[i].emplace_back(2, 0);
        // adj[i].emplace_back(2, 1);
        // i+1 er shathe
        adj[i].emplace_back(i+1, 0);
        adj[i].emplace_back(i+1, 1);
    }   
    adj[21].emplace_back(2,0);
    adj[21].emplace_back(2,1);
    v32 pw(30);
    int idx = 1;
    pw[0] = 2;
    ROF(21, 3, i) pw[idx++] = i;
    int cur = 21;
    auto rec = [&](auto&&self, v32&a, int startbit, int bit, int last)->void{
        if(a.empty()) return;
        // cout << bit << "->";
        // coutAll(a);
        if(sz(a)==(1<<bit)){
            // shob ase
            adj[last].emplace_back(pw[bit], startbit);
            return;
        }
        // divide in 1s and 0s for next bit
        v32 ones, zeros;
        trav(e, a){
            if((e>>(bit-1))&1) ones.pb(e);
            else zeros.pb(e);
        }
        // 2 branch
        // for 0
        if(sz(zeros)){
            adj[last].emplace_back(++cur, startbit);
            self(self, zeros, 0, bit-1, cur);
        }
        // for 1
        if(sz(ones)){
            adj[last].emplace_back(++cur, startbit);
            self(self, ones, 1, bit-1, cur);
        }
    };
    ROF(19, 0, bit){
        v32 a;
        while(r >= l && ((r>>bit)&1)){
            a.pb(r);
            --r;
        }
        rec(rec, a, 1, bit, 1);
    }
    queue<int>q;
    vb vis(cur+1);
    q.push(1);
    vis[1] = true;
    vvp32 ans(cur+1);
    while(!q.empty()){
        int u = q.front();
        // cout << u << " " << sz(adj[u]) << "\n";
        q.pop();
        ans[u] = adj[u];
        trav(vw, adj[u]){
            int v = vw.fi;
            // ans[u].pb(vw);
            if(!vis[v]){
                vis[v] = true;
                q.push(v);
            }
        }
    }
    // FOR(1, cur, i){
    //     if()
    // }
    map<int, int> comp;
    FOR(1, cur, i){
        if(ans[i].empty()) continue;
        // cout << i << "->";
        comp[i] = 0;
        trav(e, ans[i]){
            // cout << e.fi << " " << e.se << " ";
            comp[e.fi] = 0;
        }
        // cout << "\n";
    }
    int siz = 0;
    trav(e, comp) e.se = ++siz;
    // trav(e, comp) cout << e.fi << " " << e.se << "\n" ;
    // cur = siz;
    adj = ans;
    cout << siz << "\n";
    FOR(1, cur, j){
        int i = comp[j];
        if(i==0) continue;;
        // cout << j << " " << i << "\n";
        cout << sz(adj[j]) << " ";
        trav(e, adj[j]) cout << comp[e.fi] << " " << e.se << " ";
        cout << "\n";
    }
}


int main()
{
    fast_cin();    
    ll t = 1;
    // cin >> t;
    for(int it=1; it<=t; it++)
    {
        //cout << "Case " << it << ": ";
        solve(it);
    }
    return 0;
}