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

using pii = pair<int, int>;

const int N = 150;

int n = 22, L, R, S = 22, top = 1;
vector<pii> g[N];

int solve(string l, string r) {
    l.pop_back();
    r.pop_back();
    if(count(l.begin(), l.end(), '1') == 0 && count(r.begin(), r.end(), '0') == 0) {
        top = max(top, (int)l.size() + 1);
        return l.size() + 1;
    }
    int u = ++ n;
    if(l.back() == r.back()) g[u].emplace_back(solve(l, r), l.back() - '0');
    else{
        g[u].emplace_back(solve(l, string(l.size(), '1')), 0);
        g[u].emplace_back(solve(string(l.size(), '0'), r), 1);
    }
    return u;
}

string f(int x) {
    string ret;
    while(x > 0) {
        ret.push_back('0' + x % 2);
        x /= 2;
    }
    return ret;
}

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

    cin >> L >> R;
    for(int i = 2; i < 22; i ++) {
        g[i].emplace_back(i - 1, 0);
        g[i].emplace_back(i - 1, 1);
    }

    for(int l = L, r; l <= R; l = r + 1) {
        r = l;
        while(r != (r & -r)) r -= r & -r;
        r = r * 2 - 1;
        if(r > R) r = R;
        g[S].emplace_back(solve(f(l), f(r)), 1);
    }

    cout << n + top - 21 << "\n";
    for(int i = 1; i <= n; i ++) {
        if(i > top && i < 22) continue;
        cout << g[i].size();
        for(auto &[a, b] : g[i])
            cout << " " << (a <= top ? a : a + top - 21) << " " << b;
        cout << "\n";
    }
}