#include <bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define iter(x) (x).begin(), (x).end()
#define size(x) (int)(x).size()
#define INF 0x3f3f3f3f
#define lowbit(x) ((x) & -(x))
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
typedef long long ll;
typedef pair<int, int> pii;

void db() { cerr << endl; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

const int N = 105;
vector<pii> eg[N];
int ctp, pl[20];
int tr[2][105], ctn;

inline void ext(int k) {
    while (ctp < k) {
        pl[++ctp] = ++ctn;
        eg[ctn].pb(pl[ctp - 1], 0);
        eg[ctn].pb(pl[ctp - 1], 1);
    }
}

inline void add(int x, int lb, int vv) {
    for (int i = 20;; i--) {
        if (~(x >> i) & 1)
            continue;
        int cr = 1;
        for (;; i--) {
            if ((1 << i) == lb) {
                ext(i);
                eg[cr].pb(pl[i], vv);
                break;
            }
            int cv = (x >> i) & 1;
            if (!tr[cv][cr]) {
                tr[cv][cr] = ++ctn;
                eg[cr].pb(ctn, cv);
            }
            cr = tr[cv][cr];
        }
        break;
    }
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    pl[ctp] = ctn = 2;
    int L, R;
    cin >> L >> R, R++;
    while (L + lowbit(L) <= R) {
        add(L, lowbit(L), 1);
        L += lowbit(L);
    }
    while (R - lowbit(R) >= L) {
        add(R, lowbit(R), 0);
        R -= lowbit(R);
    }
    cout << ctn << '\n';
    for (int i = 1; i <= ctn; i++) {
        cout << size(eg[i]);
        for (pii j : eg[i])
            cout << ' ' << j.first << ' ' << j.second;
        cout << '\n';
    }
}