#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int L, R;
int a[40], b[40], tot = 1, S = 1, id[100];
int Maxp = -1;
vector<pair<int,int>> G[200];
vector<int> H[200];
void Dfs(int pos, bool flag1, bool flag2, bool zero, int now) {
    if (!flag1 && !flag2) {
        Maxp = max(Maxp, pos - 1);
        if (pos == 0) H[now].push_back(-1), H[now].push_back(-2);
        else
            H[now].push_back(pos - 1);
        return;
    }
    int up = flag1 ? a[pos] : 1;
    int down = flag2 ? b[pos] : 0;
    for (int i = down; i <= up; i++) {
        if (pos == 0) {
            if (i)
                H[now].push_back(-1);
            else H[now].push_back(-2);
            continue;
        }
        int newnow = 0;
        if (!zero || i) {
            tot++;
            G[now].push_back({tot, i});
            newnow = tot;
        }
        else newnow = now;
        Dfs(pos - 1, flag1 && i == up, flag2 && i == down, zero && i == 0, newnow);
    }
}
void Solve() {
    cin >> L >> R;
    for (int i = 0; i < 21; i++) b[i] = L >> i & 1;
    for (int i = 0; i < 21; i++) a[i] = R >> i & 1;
    int Max = max(__lg(L), __lg(R));
    Dfs(Max, 1, 1, 1, 1);
    int T = ++tot;
    for (int i = Maxp; i >= 0; i--) {
        id[i] = ++tot;
    }
    for (int i = Maxp; i >= 0; i--) {
        if (i > 0) {
            G[id[i]].push_back({id[i - 1], 0});
            G[id[i]].push_back({id[i - 1], 1});
        }
        else {
            G[id[0]].push_back({T, 0});
            G[id[0]].push_back({T, 1});
        }
    }

    for (int i = 1; i <= tot; i++) {
        for (auto x: H[i]) {
            if (x >= 0) {
                G[i].push_back({id[x], 0});
                G[i].push_back({id[x], 1});
            }
            else {
                G[i].push_back({T, (x == -1 ? 1 : 0)});
            }
        }
    }
    
    cout << tot << '\n';
    for (int i = 1; i <= tot; i++) {
        cout << G[i].size() << ' ';
        for (auto [u, v]: G[i]) {
            cout << u << ' ' << v << ' ';
        }
        cout << '\n';
    }
}
int main() {
   //freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
    int T = 1;
    while (T--){
        Solve();
    }
    return 0;
}