#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;
typedef tuple<ll, ll, ll> tll;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int N = 1000007;

int lg[N], id[101];

vector<pii> e[101];

int main() {
    lg[0] = lg[1] = 0;
    rep(i, 2, N - 1) lg[i] = lg[i >> 1] + 1;
    int L = rd(), R = rd();
    int S = 1, T = 2, tot = 2, mx = -1;

    auto print = [&]() {
        per(i, mx, 0) id[i] = ++tot;
        per(i, mx, 1) {e[id[i]].eb(id[i - 1], 0); e[id[i]].eb(id[i - 1], 1);}
        e[id[0]].eb(T, 0); e[id[0]].eb(T, 1);
        printf("%d\n", tot);
        rep(u, 1, tot) {
            printf("%d", (int)e[u].size());
            for (auto [v, w] : e[u]) printf(" %d %d", (v <= 0 ? id[-v] : v), w);
            puts("");
        }
    };

    if (L == R) { // chain
        per(i, lg[L], 1) {
            e[S].eb(++tot, ((L >> i) & 1));
            S = tot;
        }
        e[S].eb(T, (L & 1));
        print(); return 0;
    }

    if (L == 1) {
        e[S].eb(T, 1);
        per(i, lg[R] - 2, 0) e[S].eb(-i, 1); mx = max(mx, lg[R] - 2);
        int SR = ++tot; e[S].eb(SR, 1);
        per(i, lg[R] - 1, 1) { // upper bound
            if ((R >> i) & 1) {
                e[SR].eb(1 - i, 0); mx = max(mx, i - 1);
                e[SR].eb(++tot, 1); SR = tot;
            } else {
                e[SR].eb(++tot, 0); SR = tot;
            }
        }
        e[SR].eb(T, 0);
        if (R & 1) e[SR].eb(T, 1);

        print(); return 0;
    }

    if (lg[L] == lg[R]) {
        int nw = lg[L];
        while (((L >> nw) & 1) == ((R >> nw) & 1)) {
            e[S].eb(++tot, ((L >> nw) & 1));
            S = tot; --nw;
        }
        if (nw == 0) {
            e[S].eb(T, 0);
            e[S].eb(T, 1);
            print(); return 0;
        }

        int SR = ++tot; e[S].eb(SR, 1);
        per(i, nw - 1, 1) { // upper bound
            if ((R >> i) & 1) {
                e[SR].eb(1 - i, 0); mx = max(mx, i - 1);
                e[SR].eb(++tot, 1); SR = tot;
            } else {
                e[SR].eb(++tot, 0); SR = tot;
            }
        }
        e[SR].eb(T, 0);
        if (R & 1) e[SR].eb(T, 1);

        int SL = ++tot; e[S].eb(SL, 0);
        per(i, nw - 1, 1) { // lower bound
            if ((L >> i) & 1) {
                e[SL].eb(++tot, 1); SL = tot;
            } else {
                e[SL].eb(1 - i, 1); mx = max(mx, i - 1);
                e[SL].eb(++tot, 0); SL = tot;
            }
        }
        e[SL].eb(T, 1);
        if (!(L & 1)) e[SL].eb(T, 0);
    } else {
        per(i, lg[R] - 2, lg[L]) e[S].eb(-i, 1);
        if (lg[R] - 2 >= lg[L]) mx = max(mx, lg[R] - 2);
        int SR = ++tot; e[S].eb(SR, 1);
        per(i, lg[R] - 1, 1) { // upper bound
            if ((R >> i) & 1) {
                e[SR].eb(1 - i, 0); mx = max(mx, i - 1);
                e[SR].eb(++tot, 1); SR = tot;
            } else {
                e[SR].eb(++tot, 0); SR = tot;
            }
        }
        e[SR].eb(T, 0);
        if (R & 1) e[SR].eb(T, 1);

        int SL = ++tot; e[S].eb(SL, 1);
        per(i, lg[L] - 1, 1) { // lower bound
            if ((L >> i) & 1) {
                e[SL].eb(++tot, 1); SL = tot;
            } else {
                e[SL].eb(1 - i, 1); mx = max(mx, i - 1);
                e[SL].eb(++tot, 0); SL = tot;
            }
        }
        e[SL].eb(T, 1);
        if (!(L & 1)) e[SL].eb(T, 0);
    }
    print();
    return 0;
}