#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;
vector<pair<int, int> > g[1005];
int idx;

int query1(int l, int r, int L, int R){
    if (l > R or r < L) return 0;
    if (l >= L and r <= R){
        return __lg(r - l + 1);
    }
    int mid = (l + r) / 2;
    return max(query1(l, mid, L, R), query1(mid + 1, r, L, R));
}

int k;

vector<pair<int, int> > query(int l, int r, int L, int R, int dep, int val){
    if (l > R or r < L) return {};
    if (l >= L and r <= R){
        return {{k - dep + 1, val & 1}};
    }
    int mid = (l + r) / 2;
    auto ls = query(l, mid, L, R, dep - 1, val * 2 + 0);
    auto rs = query(mid + 1, r, L, R, dep - 1, val * 2 + 1);
    if (val == 0){
        for(auto x : rs) ls.push_back(x);
        return ls;
    }
    int t = ++idx;
    for(auto x : ls) g[t].push_back(x); 
    for(auto x : rs) g[t].push_back(x); 
    return {{t, val & 1}};
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int l, r;
    cin >> l >> r;
    int m = __lg(r);
    while((1 << m) - 1 < r) m += 1;
    k = query1(0, (1 << m) - 1, l, r);
    // k + 1 个点
    for(int i = 1; i <= k; i++){
        g[i].push_back({i + 1, 0});
        g[i].push_back({i + 1, 1});
    }
    idx = k + 1;
    int root = ++idx;
    g[root] = query(0, (1 << m) - 1, l, r, m, 0);
    cout << idx << '\n';
    for(int i = 1; i <= idx; i++){
        cout << g[i].size();
        for(auto [x, y] : g[i]) cout << ' ' << x << ' ' << y;
        cout << '\n';
    }

}