#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << "\n";}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for(int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int M = 1e6 + 5;
const int N = 1005;

int L, R, sz, tz;
bool is[M];
int mx, to[N][2], a[N];
vector<pair<int, int>> v, adj[N];

void solve() {
    cin >> L >> R;
    for (int i = L; i <= R;) {
        int len = 1;
        while (i % (len * 2) == 0) len *= 2;
        while (i + len - 1 > R) len /= 2;
        int j = i + len - 1;
        v.pb(i, j);
        i = j + 1;
    }
    sz = tz = 1;
    for (auto [l, r] : v) {
        int n = __lg(l) + 1, len = __lg(r - l + 1);
        mx = max(mx, len);
        for (int pos = 1, i = 1, p = n - 1; i <= n - len; i++, p--) {
            int b = l >> p & 1;
            if (to[pos][b] == 0) to[pos][b] = ++tz;
            pos = to[pos][b];
        }
    }
    sz++;
    FOR (i, 1, mx) {
        sz++;
        adj[sz - 1].pb(sz, 0);
        adj[sz - 1].pb(sz, 1);
    }
    a[1] = 1;
    for (auto [l, r] : v) {
        int n = __lg(l) + 1, len = __lg(r - l + 1);
        mx = max(mx, len);
        for (int pos = 1, i = 1, p = n - 1; i <= n - len; i++, p--) {
            int b = l >> p & 1, nxt = to[pos][b];
            if (i < n - len) {
                if (a[nxt] == 0) a[nxt] = ++sz;
                pos = nxt;
                continue;
            }
            int j = mx + 2 - len;
            adj[a[pos]].pb(j, b);
        }
    }
    auto dfs = [&](auto dfs, int pos)->void {
        int nxt = to[pos][0];
        if (nxt) {
            if (a[nxt]) adj[a[pos]].pb(a[nxt], 0);
            dfs(dfs, nxt);
        }
        nxt = to[pos][1];
        if (nxt) {
            if (a[nxt]) adj[a[pos]].pb(a[nxt], 1);
            dfs(dfs, nxt);
        }
    };
    dfs(dfs, 1);
    int x = mx + 2;
    swap(adj[x], adj[sz]);
    FOR (i, 1, sz) for (auto &[j, y] : adj[i]) {
        if (j == x) j = sz;
        else if (j == sz) j = x;
    }
    cout << sz << '\n';
    FOR (i, 1, sz) {
        cout << adj[i].size();
        for (auto [j, x] : adj[i]) cout << ' ' << j << ' ' << x;
        cout << '\n';
    }
}

int main() {
    Waimai;
    solve();
}