#include <bits/stdc++.h>

using LL = long long;

constexpr int inf = 1E9;

std::vector<std::array<int, 2>> node(1);
std::vector<int> t[101];
std::vector<std::pair<int ,int>> ans[101], tmp;

int new_node()
{
    node.emplace_back();
    return node.size() - 1;
}

int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int l, r;
    std::cin >> l >> r;

    int x = l;
    while (x <= r)
    {
        int z = x & -x;
        while (x + z - 1 > r)
        {
            z >>= 1;
        }
        int y = x + z - 1;
        int i = 19, p = 0;
        while ((x >> i & 1) == 0) { i--; }
        while (i > 0 && (x >> i & 1) == (y >> i & 1))
        {
            int b = x >> i & 1;
            if (node[p][b] == 0)
            {
                node[p][b] = new_node();
            }
            p = node[p][b];
            i--;
        }
        if (i == 0 && (x & 1) == (y & 1))
        {
            tmp.emplace_back(p, x & 1);
        }
        else
        {
            t[p].emplace_back(i);
        }
        x += z;
    }

    int n = node.size();
    int m = 0;

    for (auto [p, i] : tmp)
    {
        ans[p].emplace_back(n, i);
    }

    auto dfs = [&](auto &&self, int p) -> void
    {
        for (int i = 0; i < 2; i++)
        {
            if (node[p][i])
            {
                ans[p].emplace_back(node[p][i], i);
                self(self, node[p][i]);
            }
        }
        for (auto s : t[p])
        {
            ans[p].emplace_back(s + n, 0);
            ans[p].emplace_back(s + n, 1);
            m = std::max(m, s);
        }
    };
    dfs(dfs, 0);
    for (int i = m; i > 0; i--)
    {
        ans[i + n].emplace_back(i + n - 1, 0);
        ans[i + n].emplace_back(i + n - 1, 1);
    }

    n += m + 1;
    std::cout << n << '\n';

    for (int i = 0; i < n; i++)
    {
        std::cout << ans[i].size();
        for (auto [x, y] : ans[i])
        {
            std::cout << ' ' << x + 1 << ' ' << y;
        }
        std::cout << '\n';
    }

    return 0;
}