#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;


namespace nachia {

struct DsuFast{
private:
    std::vector<int> w;
public:
    DsuFast(int n = 0) : w(n, -1) {}
    int leader(int u){
        if(w[u] < 0) return u;
        return w[u] = leader(w[u]);
    }
    int operator[](int u){ return leader(u); }
    int merge(int u, int v){
        u = leader(u);
        v = leader(v);
        if(u == v) return u;
        if(-w[u] < -w[v]) std::swap(u, v);
        w[u] += w[v];
        w[v] = u;
        return u;
    }
    int size(int u){ return -w[leader(u)]; }
    bool same(int u, int v){ return leader(u) == leader(v); }
};

} // namespace nachia

void testcase(){
    i64 L, R; cin >> L >> R;

    int msbR = 20;
    while(R < (1 << msbR)) msbR--;
    int msbL = 20;
    while(L < (1 << msbL)) msbL--;

    if(L == R){
        cout << (msbR+2) << '\n';
        rep(i,msbR+1){
            int v = (R >> (msbR-i)) & 1;
            cout << "1 " << (i+2) << " " << v << '\n';
        }
        cout << "0\n";
        return;
    }

    auto dsu = nachia::DsuFast(10000);

    int B = 20;

    struct Edge {
        int u;
        int v;
        int w;
    };
    int N = B + 2;
    int src = B + 1;
    int snk = 0;
    vector<Edge> X;
    rep(j,20) rep(t,2) X.push_back({ j+1, j, t });
    X.push_back({ 0, src, -1 });

    auto procL = [&](int s, int b) -> void {
        for(int t=b-1; t>=0; t--){
            int ss = N++;
            int lbit = (L >> t) & 1;
            X.push_back({ s, ss, lbit });
            if(lbit == 0){
                X.push_back({ s, t, 1 });
            }
            s = ss;
        }
        dsu.merge(s, snk);
    };

    auto procR = [&](int s, int b) -> void {
        for(int t=b-1; t>=0; t--){
            int ss = N++;
            int lbit = (R >> t) & 1;
            X.push_back({ s, ss, lbit });
            if(lbit == 1){
                X.push_back({ s, t, 0 });
            }
            s = ss;
        }
        dsu.merge(s, snk);
    };

    int lstart = src;
    int rstart = src;
    
    if(msbL == msbR){
        while(true){
            int lbit = (L >> msbL) & 1;
            int rbit = (R >> msbR) & 1;
            if(lbit == rbit){
                int ss = N++;
                X.push_back({ lstart, ss, lbit });
                lstart = rstart = ss;
                msbL--;
                msbR--;
                continue;
            }
            break;
        }
        int s1 = N++;
        X.push_back({ lstart, s1, 0 });
        lstart = s1;
        int s2 = N++;
        X.push_back({ rstart, s2, 1 });
        rstart = s2;
        procL(lstart, msbL);
        procR(rstart, msbR);
    } else {
        int s2 = N++;
        X.push_back({ rstart, s2, 1 });
        rstart = s2;
        procR(rstart, msbR);

        for(int k=msbL+1; k<msbR; k++){
            X.push_back({ lstart, k, 1 });
        }
        int s1 = N++;
        X.push_back({ lstart, s1, 1 });
        lstart = s1;
        procL(lstart, msbL);
    }

    for(auto& e : X){
        e.u = dsu[e.u];
        e.v = dsu[e.v];
    }

    {
        vector<int> mp(N);
        while(true){
            vector<int> id(N);
            vector<int> od(N);
            for(auto e : X) if(mp[e.u] >= 0 && mp[e.v] >= 0){
                id[e.u] += 1;
                od[e.v] += 1;
            }
            int cnt = 0;
            rep(i,N) if(mp[i] != -1 && (id[i] == 0 || od[i] == 0)){ mp[i] = -1; cnt++; }
            if(cnt == 0) break;
        }
        int f = 0;
        rep(i,N) if(mp[i] >= 0) mp[i] = f++;
        N = f;
        vector<Edge> Y;
        for(auto e : X){
            e.u = mp[e.u];
            e.v = mp[e.v];
            if(e.u >= 0 && e.v >= 0 && e.w >= 0) Y.push_back(e);
        }
        swap(X, Y);
    }
    vector<vector<pair<int,int>>> adj(N);
    for(auto e : X) adj[e.u].push_back({ e.v + 1, e.w });
    cout << N << "\n";
    for(auto a : adj){
        cout << a.size();
        for(auto [u,v] : a) cout << " " << u << " " << v;
        cout << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}