#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int l, r;
    cin >> l >> r;
    r ++;
    int n = 100;
    vector<vector<pair<int, int>>> v(n);
    for(int i = 80; i <= 98; i ++) {
        v[i].push_back({i + 1, 0});
        v[i].push_back({i + 1, 1});
    }
    if(l == 1) {
        v[0].push_back({n - 1, 1});
        l ++;
    }
    vector<int> ato;
    for(int i = 1; i <= 20; i ++) {
        int le = (1 << i);
        int ri = (1 << (i + 1));
        if(l <= le and ri <= r) {
            v[0].push_back({n - 1 - i, 1});
        } else {
            if(r <= le or ri <= l) continue;
            ato.push_back(i);
        }
    }
    int j = 0; 
    auto dfs = [&](auto dfs, int now, int le, int ri, int bitid) -> void {
        // cout << le << " " << ri << " " << bitid << endl;
        int mid = 1 << bitid;
        if(le < mid) {
            // 0あり
            if(ri >= mid and le == 0) {
                v[now].push_back({n - bitid - 1, 0});
            } else {
                j ++;
                v[now].push_back({j, 0});
                dfs(dfs, j, le, min(mid, ri), bitid - 1);
            }
        } 
        if(mid < ri) {
            // 1あり
            if(le <= mid and ri == mid * 2) {
                v[now].push_back({n - bitid - 1, 1});
            } else {
                j ++;
                v[now].push_back({j, 1});
                dfs(dfs, j, max(le - mid, 0), ri - mid, bitid - 1);
            }
        }
    };
    foa(i, ato) {
        dfs(dfs, 0, max(l, 1 << i), min(r, 1 << (i + 1)), i);
    }
    int M = n - 1;
    j ++;
    rep(i, j) {
        for(auto [x, y] : v[i]) {
            if(x >= j) M = min(M, x);
        }
    }
    int diff = M - j;
    // cout << j << " " << M << " " << diff << endl;
    n -= diff;
    for(int i = j; i < n; i ++) {
        v[i] = v[i + diff];
    }
    v.resize(n);
    
    
    
    rep(i, n) {
        int sz = v[i].size();
        rep(k, sz) {
            if(v[i][k].first >= j) {
                v[i][k].first -= diff;
            }
        }
    }
    // auto check = [&](auto check, int now, int num) -> void {
    //     if(now == n - 1) {
    //         cout << num << " ";
    //         return;
    //     }
    //     for(auto [x, y] : v[now]) {
    //         check(check, x, num * 2 + y);
    //     }
    // };
    // check(check, 0, 0);
    // cout << endl;
    
    cout << n << '\n';
    rep(i, n) {
        sort(all(v[i]));
        cout << v[i].size() << " ";
        for(auto [x, y] : v[i]) {
            cout << x + 1 << " " << y << " "; ////////
        }
        cout << '\n';
    }
    return 0;
}