#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

u64 lowbit(u64 x) { return x & -x; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    u64 l, r; cin >> l >> r;
    int cnt = 1;
    vector<array<int, 2>> adj(1);
    vector<vector<pair<int, bool>>> add(1);
    auto newNode = [&]() {
        adj.push_back({-1, -1});
        add.push_back({});
        return cnt++;
    };

    map<int, int> line;
    
    int line_cnt = 1; line[0] = 0;
    auto getLineID = [&](int p) {
        while (line_cnt <= p) {
            int id = newNode();
            adj[id][0] = adj[id][1] = line[line_cnt - 1];
            line[line_cnt++] = id;
        }
        return line[p];
    };

    int root = newNode();
    auto ins = [&](u64 x, int lb) {
        int now = root;
        for (int b = __lg(x); b >= lb; b--) {
            int dg = x >> b & 1;
            if (b == lb) {
                getLineID(lb);
                add[now].push_back(pair{line[lb], dg});
                return;
            }
            if (adj[now][dg] == -1) adj[now][dg] = newNode();
            now = adj[now][dg];
        }
    };
    for (u64 now = l; now <= r; ) {
        if (now + lowbit(now) <= r + 1) {
            ins(now, countr_zero(now));
            now += lowbit(now);
        } else {
            u64 add = bit_floor(now ^ (r + 1));
            ins(now, countr_zero(add));
            now += add;
        }
    }
    cout << cnt << "\n";
    cout << 0 << "\n";
    for (int i = 1; i < cnt; i++) {
        vector<pair<int, bool>> edges = add[i];
        if (adj[i][0] != -1) edges.push_back({adj[i][0], 0});
        if (adj[i][1] != -1) edges.push_back({adj[i][1], 1});
        cout << edges.size() << " ";
        for (auto [j, v]: edges) cout << j + 1 << " " << v << " ";
        cout << "\n";
    }
}