#include <bits/stdc++.h>
using namespace std;
#define int ll

#define fi first
#define se second
#define mpr make_pair
#define ll long long
#define pb push_back

const int Mod = 998244353;
int g[21][2][2][2];
vector<pair<int, int>> G[105];
void solve() {
    int l, r;
    cin >> l >> r;
    int tot = 2;
    auto dfs = [&](auto self, int x, int opt1, int opt2, int opt3) -> int {
        if (g[x][opt1][opt2][opt3]) return g[x][opt1][opt2][opt3];
        if (x == -1) {
            return 1;
        }
        if (opt3) {
            g[x][opt1][opt2][opt3] = ++tot;
        } else {
            g[x][opt1][opt2][opt3] = 2;
        }
        int t = g[x][opt1][opt2][opt3];
        int lim1 = opt1 ? (l >> x & 1) : 0;
        int lim2 = opt2 ? (r >> x & 1) : 1;
        for (int i = lim1; i <= lim2; i++) {
            int opt11 = opt1 & (i == lim1);
            int opt22 = opt2 & (i == lim2);
            int opt33 = opt3 | i;
            int h = self(self, x - 1, opt11, opt22, opt33);
            // cerr << x << ' ' << opt1 << ' ' << opt2 << ' ' << opt3 << ' ' << i << ' ' << h << '\n';
            if (opt33) {
                G[t].emplace_back(h, i);
            }
        }
        return t;
    };
    dfs(dfs, 20, 1, 1, 0);
    cout << tot << '\n';
    for (int i = 1; i <= tot; i++) {
        cout << G[i].size() << ' ';
        for (auto [a, v] : G[i]) cout << a << ' ' << v << ' ';
        cout << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}