#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 1e9;
const ll INF = 2e18;
const int LG = 20;

void solve() {
    int L, R; cin >> L >> R;
    int s = 0;
    int bit = 0;
    while ((1 << bit) <= R) bit++;
    bit--;
    vector<vector<pair<int, int>>> g(bit + 2);
    vector<int> oth = {bit + 1};
    bool eq = true;
    int from = 0;
    int bb = 0;
    auto Get = [&] (int t) {
        while (oth.size() <= t) {
            int k = oth.size();
            int who = g.size();
            oth.push_back(who);
            g.emplace_back();
            g[who].emplace_back(oth[k - 1], 1);
            g[who].emplace_back(oth[k - 1], 0);
        }
        return oth[t];
    };
    for(int i = bit; i >= 0; --i) {
        g[bit - i].emplace_back(bit - i + 1, (R >> i) & 1);
        if ((R >> i) & 1) {
            if (!eq) {
                int nx = Get(i);
                g[bit - i].emplace_back(nx, 0);
            }
        }
        if (eq && (L >> i) != (R >> i)) {
            eq = false;
            from = bit - i;
            bb = i;
        }
    }
    auto create = [&] () {
        int v = g.size();
        g.emplace_back();
        return v;
    };
    if (!eq) {
        int cur = from;
        if ((L >> from) == 0) {
            cur = 0;
        }
        for(int i = bb; i >= 0; --i) {
            int to = cur;
            if (L >> i) {
                int nx = oth[0];
                if (i != 0) nx = create();
                g[cur].emplace_back(nx, (L >> i) & 1);
                to = nx;
            }
            if ((L >> i) & 1) {

            } else if (i != bb) {
                int wt = Get(i);
                g[cur].emplace_back(wt, 1);
            }
            cur = to;
        }
    }
    cout << g.size() << '\n';
    rep(i, g.size()) {
        cout << g[i].size() << ' ';
        for(auto &[x, y] : g[i]) cout << x + 1 << ' ' << y << ' ';
        cout << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
    rep(i, t) {
        solve();
    }
    return 0;
}