#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define pb push_back
void debug() {std::cerr << "\n";}
template<class T, class... OtherArgs>
void debug(T &&var, OtherArgs &&... args) {
    std::cerr << std::forward<T>(var) << " ";
    debug(std::forward<OtherArgs>(args)...);
}
#define SZ(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using i64 = long long;
using u64 = unsigned long long;
using LD = long double;
using PII = pair<int, int>;
constexpr int N = 200010;
constexpr int P = 1e9 + 7;

vector<PII> adj[310];

void solve() {
    int l, r;
    cin >> l >> r;
    // l = rng() % 10000 + 1, r = rng() % 30000 + l;
    // debug("?", l, r);
    
    auto f = [&](int x, int bit) {
        return x == (1 << bit + 1) - 1;
    };

    map<int, int> mp;
    int tot = 1, highbit = 31 - __builtin_clz(r);
    int zero = -1;
    function<void(int, int, int, int)> solve = [&](int u, int l, int r, int bit) {
        // debug("?", u, l, r, bit);
        // assert(l <= r);
        if (l == 0 && r == 0 && bit == -1) {
            zero = u;
            return;
        }
        if (l == 0 && f(r, bit)) {
            // assert(u != 1);
            int val = (1 << bit + 1) - 1;
            if (bit == 0) {
                if (zero == -1) {
                    zero = ++tot;
                }
                adj[u].pb({zero, 0});
                adj[u].pb({zero, 1});
                return;
            }
            if (!mp[val]) {
                mp[val] = ++tot;
                adj[u].pb({mp[val], 0});
                adj[u].pb({mp[val], 1});
                int rbit = r == 0 ? 0 : 31 - __builtin_clz(r);
                int v = (r == 0 ? 0 : (1 << rbit));
                // debug("!", l, r, rbit);
                solve(tot, 0, r - v, bit - 1);
            } else {
                adj[u].pb({mp[val], 0});
                adj[u].pb({mp[val], 1});
            }
            return;
        }
        
        int lbit = l == 0 ? -1 : 31 - __builtin_clz(l);
        int rbit = r == 0 ? -1 : 31 - __builtin_clz(r);
        if (rbit < bit) {
            // assert(u != 1);
            adj[u].pb({++tot, 0});
            solve(tot, l, r, bit - 1);
        } else if (lbit == rbit) {
            int v = (r == 0 ? 0 : (1 << rbit));
            if (bit == 0) {
                if (zero == -1) {
                    adj[u].pb({++tot, v != 0});
                    // debug("????", l - v, r - v, l, r, v, rbit, bit);
                    solve(tot, l - v, r - v, bit - 1);
                } else {
                    adj[u].pb({zero, v != 0});
                }
            } else {
                adj[u].pb({++tot, 1});
                solve(tot, l - v, r - v, bit - 1);
            }
        } else {
            int v = (r == 0 ? 0 : (1 << rbit));
            adj[u].pb({++tot, 1});
            solve(tot, 0, r - v, bit - 1);
            if (u != 1) {
                adj[u].pb({++tot, 0});
                solve(tot, l, v - 1, bit - 1);
            } else {
                solve(u, l, v - 1, bit - 1);
            }
        }
    };
    solve(1, l, r, highbit);

    cout << tot << '\n';
    for (int i = 1; i <= tot; i++) {
        cout << SZ(adj[i]);
        for (const auto &[v, w] : adj[i]) {
            cout << ' ' << v << ' ' << w;
        }
        cout << '\n';
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    int _ = 1;
    // cin >> _;
    while (_--) {
        solve();
    }
}