#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
#define fi first
#define se second 
#define V vector
#define pb push_back
typedef long long LL;


void solve() {
    int l, r; cin >> l >> r;
    int tot = 2;
    V<V<pi>> e(101);
    map<array<int, 4>, int> mp;
    auto dfs = [&](int l, int r, int now, bool prez, auto dfs) -> int {
        if(now == -1) return 2;
        if(mp.count({l, r, now, prez})) return mp[{l, r, now, prez}];
        // int x = ++tot;
        int x;
        if(prez) x = 1;
        else x = ++tot;

        if(r >> now & 1) {
            int n_r = r - (1 << now);
            int n_l = max(0, l - (1 << now));
            e[x].pb({dfs(n_l, n_r, now - 1, 0, dfs), 1});
        } 
        if(!(l >> now & 1)) {
            int n_l = l;
            int n_r = min((1 << now) - 1, r);
            if(!prez) e[x].pb({dfs(n_l, n_r, now - 1, prez, dfs), 0});
            else dfs(n_l, n_r, now - 1, prez, dfs);
        } 
        return mp[{l, r, now, prez}] = x;
    };
    dfs(l, r, 19, 1, dfs);
    cout << tot << endl;
    for(int i = 1; i <= tot; i++) {
        int x = i;
        cout << e[x].size() << " ";
        for(auto [y, w] : e[x]) cout << y << " " << w << " ";
        cout << endl;
    }

}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    // int t; cin >> t;
    // while(t--) 
    solve();
}