#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
vector<vector<pair<int, int>>> adj(101);
int l, r;

void solve() {
    cin >> l >> r;
    int rb = 0, lb = 0;
    for (int i = 25; i >= 0; i--) {
        if (r >> i & 1) {
            rb = i;
            break;
        }
    }
    for (int i = 25; i >= 0; i--) {
        if (l >> i & 1) {
            lb = i;
            break;
        }
    }

    int n = 100;
    vector<vector<int>> ans(n + 1);
    int idx = 2;
    auto print = [&]() {
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < ans[i].size(); j += 2) {
                // cout << i << ' ' << ans[i][j] << ' ' << ans[i][j + 1] << endl;
                adj[i].emplace_back(ans[i][j], ans[i][j + 1]);
            }
        }
    };
    auto addedge = [&](int a, int b, int w) {
    	assert(idx <= 100);
        // cout << a << ' ' << b << ' ' << w << endl;
        ans[a].emplace_back(b);
        ans[a].emplace_back(w);
    };

    int s = 1, t = n;

    for (int i = 80; i < 100; i++) {
        addedge(i, i + 1, 1);
        addedge(i, i + 1, 0);
    }

    auto add_power_edge = [&](int idx, int bit, int w) {
        // 目的地是 bit 位
        addedge(idx, 99 - bit, w);
    };

    auto work = [&](int l, int r) {
        // 保证进入时，idx 是一个新的空节点，返回时，idx 是一个新的节点
    	// cout << l << ' ' << r << endl;
    	// cout << bitset<21>(l) << ' ' << bitset<21>(r) << endl;
        if (l > r) return;
        int rb = 0, lb = 0, diff = 0;
        for (int i = 25; i >= 0; i--) {
            if (r >> i & 1) {
                rb = i;
                break;
            }
        }
        for (int i = 25; i >= 0; i--) {
            if (l >> i & 1) {
                lb = i;
                break;
            }
        }
        for (int i = rb; i >= 0; i--) {
            if ((r >> i & 1) && !(l >> i & 1)) {
                diff = i;
                break;
            }
        }
        assert(rb == lb);
        if (l == r) {
            if (l == 1) {
                addedge(s, t, 1);
            } else {
                addedge(s, idx, 1);
                for (int i = rb - 1; i > 0; i--) {
                    addedge(idx, idx + 1, r >> i & 1);
                    idx++;
                }
                addedge(idx, t, r & 1);
                idx++;
            }
            return;
        }

        if (diff == 0) {
            assert(lb > 0);
            addedge(s, idx, 1);
            for (int i = rb - 1; i > 0; i--) {
                addedge(idx, idx + 1, r >> i & 1);
                idx++;
            }
            addedge(idx, t, 1);
            addedge(idx, t, 0);
            idx++;
            return;
        }

        // cout << l << ' ' << r << ' ' << rb << ' ' << lb << ' ' << diff << endl;
        addedge(s, idx, 1);
        assert(diff < rb);

        for (int i = rb - 1; i > diff; i--) {
            addedge(idx, idx + 1, r >> i & 1);
            idx++;
        }
        int pre = idx;

        addedge(idx, idx + 1, 1);
        idx++;
        for (int i = diff - 1; i > 0; i--) {
            if (r >> i & 1) { // 这里有大问题！！！
                add_power_edge(idx, i - 1, 0);
                addedge(idx, idx + 1, 1);
                idx++;
            } else {
                addedge(idx, idx + 1, 0);
                idx++;
            }
        }
        if (r & 1) {
            addedge(idx, t, 1);
            addedge(idx, t, 0);
        } else {
            addedge(idx, t, 0);
        }

        addedge(pre, idx + 1, 0);
        idx++;
        for (int i = diff - 1; i > 0; i--) {
            if (l >> i & 1) {
                addedge(idx, idx + 1, 1);
                idx++;
            } else {
                add_power_edge(idx, i - 1, 1);
                addedge(idx, idx + 1, 0);
                idx++;
            }
        }
        if (l & 1) {
            addedge(idx, t, 1);
        } else {
            addedge(idx, t, 1);
            addedge(idx, t, 0);
        }
        idx++;
    };

    if (rb <= lb) {
        work(l, r);
        print();
        return;
    }
    work(1 << rb, r);
    work(l, (1 << lb + 1) - 1);

    if (rb - 1 >= lb + 1) {
        for (int i = rb - 1; i >= lb + 1; i--) {
            addedge(s, 100 - i, 1);
        }
    }
    print();

}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    // cin >> t;

    while (t--) {
        solve();
    }

	vector<set<pair<int, int>>> g(101);
    auto dfs = [&](auto self, int u) -> void {
        for (auto [v, w] : adj[u]) {
            g[u].insert({v, w});
            self(self, v);
        }
    };
    dfs(dfs, 1);
    for (int i = 1; i <= 100; i++) {
        adj[i].clear();
        for (auto [v, w] : g[i]) {
            adj[i].emplace_back(v, w);
        }
    }

    int a = 1, b = 99;
    while (!adj[a].empty()) {
    	a++;
    }
    while (!adj[b].empty()) {
    	b--;
    }
    b++;
    map<int, int> map;
    while (b <= 100) {
    	swap(adj[a], adj[b]);
    	map[b] = a;
    	a++, b++;
    }
    for (int i = 1; i <= a; i++) {
    	for (auto &[x, y] : adj[i]) {
    		if (map.count(x)) x = map[x];
    	}
    }
 	
 	cout << a - 1 << "\n";
    for (int i = 1; i < a; i++) {
    	cout << adj[i].size() << " ";
        for (auto [v, w] : adj[i]) {
            cout << v << ' ' << w << " ";
        }
        cout << "\n";
    }

    return 0;
}